%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ005+1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:01:20 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 11 unt; 0 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 141 ( 63 ~; 47 |; 8 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 54 ( 0 sgn 33 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lion_lies_on_neither,axiom,
! [X1] :
( day(X1)
=> ! [X2] :
( day(X2)
=> ( ( ~ lies_on_one_of(a_lion,X1,X2)
& ~ lion_lies(X1) )
=> ~ lion_lies(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lion_lies_on_neither) ).
fof(prove_there_are_close_lying_days,conjecture,
? [X1] :
( lies_on_one_of(a_unicorn,X1,yesterday(X1))
& lies_on_one_of(a_lion,X1,yesterday(X1))
& day(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_are_close_lying_days) ).
fof(lion_lies_on_a_day,axiom,
! [X1] :
( lion_lies(X1)
=> day(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lion_lies_on_a_day) ).
fof(thursday_follows_wednesday,axiom,
! [X1] :
( thursday(X1)
=> wednesday(yesterday(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thursday_follows_wednesday) ).
fof(lion_does_not_lie_thursday,axiom,
! [X1] :
( thursday(X1)
=> ~ lion_lies(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lion_does_not_lie_thursday) ).
fof(lion_lies_wednesday,axiom,
! [X1] :
( wednesday(X1)
=> lion_lies(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lion_lies_wednesday) ).
fof(thursday,axiom,
thursday(a_thursday),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thursday) ).
fof(thursday_is_a_day,axiom,
! [X1] :
( thursday(X1)
=> day(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thursday_is_a_day) ).
fof(unicorn_lies_on_both,axiom,
! [X1] :
( day(X1)
=> ! [X2] :
( day(X2)
=> ( ( ~ lies_on_one_of(a_unicorn,X1,X2)
& unicorn_lies(X1) )
=> unicorn_lies(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unicorn_lies_on_both) ).
fof(unicorn_does_not_lie_wednesday,axiom,
! [X1] :
( wednesday(X1)
=> ~ unicorn_lies(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unicorn_does_not_lie_wednesday) ).
fof(unicorn_lies_on_a_day,axiom,
! [X1] :
( unicorn_lies(X1)
=> day(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unicorn_lies_on_a_day) ).
fof(unicorn_lies_thursday,axiom,
! [X1] :
( thursday(X1)
=> unicorn_lies(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unicorn_lies_thursday) ).
fof(wednesday_is_a_day,axiom,
! [X1] :
( wednesday(X1)
=> day(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wednesday_is_a_day) ).
fof(c_0_13,plain,
! [X1] :
( day(X1)
=> ! [X2] :
( day(X2)
=> ( ( ~ lies_on_one_of(a_lion,X1,X2)
& ~ lion_lies(X1) )
=> ~ lion_lies(X2) ) ) ),
inference(fof_simplification,[status(thm)],[lion_lies_on_neither]) ).
fof(c_0_14,negated_conjecture,
~ ? [X1] :
( lies_on_one_of(a_unicorn,X1,yesterday(X1))
& lies_on_one_of(a_lion,X1,yesterday(X1))
& day(X1) ),
inference(assume_negation,[status(cth)],[prove_there_are_close_lying_days]) ).
fof(c_0_15,plain,
! [X37,X38] :
( ~ lion_lies(X38)
| lies_on_one_of(a_lion,X37,X38)
| lion_lies(X37)
| ~ day(X38)
| ~ day(X37) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_16,plain,
! [X31] :
( day(X31)
| ~ lion_lies(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lion_lies_on_a_day])])]) ).
fof(c_0_17,plain,
! [X13] :
( wednesday(yesterday(X13))
| ~ thursday(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[thursday_follows_wednesday])])]) ).
fof(c_0_18,plain,
! [X1] :
( thursday(X1)
=> ~ lion_lies(X1) ),
inference(fof_simplification,[status(thm)],[lion_does_not_lie_thursday]) ).
fof(c_0_19,negated_conjecture,
! [X49] :
( ~ lies_on_one_of(a_unicorn,X49,yesterday(X49))
| ~ lies_on_one_of(a_lion,X49,yesterday(X49))
| ~ day(X49) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_20,plain,
( ~ lion_lies(X2)
| ~ day(X2)
| ~ day(X1)
| lies_on_one_of(a_lion,X1,X2)
| lion_lies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ lion_lies(X1)
| day(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X19] :
( lion_lies(X19)
| ~ wednesday(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lion_lies_wednesday])])]) ).
cnf(c_0_23,plain,
( ~ thursday(X1)
| wednesday(yesterday(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
thursday(a_thursday),
inference(split_conjunct,[status(thm)],[thursday]) ).
fof(c_0_25,plain,
! [X6] :
( day(X6)
| ~ thursday(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[thursday_is_a_day])])]) ).
fof(c_0_26,plain,
! [X20] :
( ~ lion_lies(X20)
| ~ thursday(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
fof(c_0_27,plain,
! [X1] :
( day(X1)
=> ! [X2] :
( day(X2)
=> ( ( ~ lies_on_one_of(a_unicorn,X1,X2)
& unicorn_lies(X1) )
=> unicorn_lies(X2) ) ) ),
inference(fof_simplification,[status(thm)],[unicorn_lies_on_both]) ).
fof(c_0_28,plain,
! [X1] :
( wednesday(X1)
=> ~ unicorn_lies(X1) ),
inference(fof_simplification,[status(thm)],[unicorn_does_not_lie_wednesday]) ).
cnf(c_0_29,negated_conjecture,
( ~ lies_on_one_of(a_unicorn,X1,yesterday(X1))
| ~ lies_on_one_of(a_lion,X1,yesterday(X1))
| ~ day(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( ~ day(X1)
| ~ lion_lies(X2)
| lion_lies(X1)
| lies_on_one_of(a_lion,X1,X2) ),
inference(csr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,plain,
( ~ wednesday(X1)
| lion_lies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
wednesday(yesterday(a_thursday)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
( ~ thursday(X1)
| day(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( ~ lion_lies(X1)
| ~ thursday(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_35,plain,
! [X47,X48] :
( unicorn_lies(X48)
| lies_on_one_of(a_unicorn,X47,X48)
| ~ unicorn_lies(X47)
| ~ day(X48)
| ~ day(X47) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
fof(c_0_36,plain,
! [X32] :
( day(X32)
| ~ unicorn_lies(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unicorn_lies_on_a_day])])]) ).
fof(c_0_37,plain,
! [X27] :
( unicorn_lies(X27)
| ~ thursday(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unicorn_lies_thursday])])]) ).
fof(c_0_38,plain,
! [X5] :
( day(X5)
| ~ wednesday(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[wednesday_is_a_day])])]) ).
fof(c_0_39,plain,
! [X26] :
( ~ unicorn_lies(X26)
| ~ wednesday(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ day(X1)
| ~ lion_lies(yesterday(X1))
| ~ lies_on_one_of(a_unicorn,X1,yesterday(X1))
| lion_lies(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
lion_lies(yesterday(a_thursday)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
day(a_thursday),
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_43,plain,
~ lion_lies(a_thursday),
inference(spm,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_44,plain,
( ~ unicorn_lies(X1)
| ~ day(X2)
| ~ day(X1)
| unicorn_lies(X2)
| lies_on_one_of(a_unicorn,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
( ~ unicorn_lies(X1)
| day(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
( ~ thursday(X1)
| unicorn_lies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
( ~ wednesday(X1)
| day(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
( ~ unicorn_lies(X1)
| ~ wednesday(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,negated_conjecture,
~ lies_on_one_of(a_unicorn,a_thursday,yesterday(a_thursday)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_50,plain,
( ~ day(X2)
| ~ unicorn_lies(X1)
| unicorn_lies(X2)
| lies_on_one_of(a_unicorn,X1,X2) ),
inference(csr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
unicorn_lies(a_thursday),
inference(spm,[status(thm)],[c_0_46,c_0_24]) ).
cnf(c_0_52,plain,
day(yesterday(a_thursday)),
inference(spm,[status(thm)],[c_0_47,c_0_32]) ).
cnf(c_0_53,plain,
~ unicorn_lies(yesterday(a_thursday)),
inference(spm,[status(thm)],[c_0_48,c_0_32]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ005+1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 03:45:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1925279 completed with status 0
% 0.15/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1925285 completed with status 0
% 0.15/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.45 % Preprocessing time : 0.002 s
% 0.15/0.45 % Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 46
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 46
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 46
% 0.15/0.45 % Processed clauses : 158
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 7
% 0.15/0.45 % ...remaining for further processing : 151
% 0.15/0.45 % Other redundant clauses eliminated : 0
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 0
% 0.15/0.45 % Backward-rewritten : 2
% 0.15/0.45 % Generated clauses : 101
% 0.15/0.45 % ...of the previous two non-redundant : 80
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 9
% 0.15/0.45 % Paramodulations : 101
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 0
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 27
% 0.15/0.45 % ...of those cached : 11
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 103
% 0.15/0.45 % Positive orientable unit clauses : 37
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 18
% 0.15/0.45 % Non-unit-clauses : 48
% 0.15/0.45 % Current number of unprocessed clauses: 14
% 0.15/0.45 % ...number of literals in the above : 23
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 48
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 989
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 562
% 0.15/0.45 % Non-unit clause-clause subsumptions : 9
% 0.15/0.45 % Unit Clause-clause subsumption calls : 203
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 2
% 0.15/0.45 % BW rewrite match successes : 2
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 4409
% 0.15/0.45 % Search garbage collected termcells : 516
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.012 s
% 0.15/0.45 % System time : 0.003 s
% 0.15/0.45 % Total time : 0.015 s
% 0.15/0.45 % Maximum resident set size: 3612 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.036 s
% 0.15/0.45 % System time : 0.012 s
% 0.15/0.45 % Total time : 0.048 s
% 0.15/0.45 % Maximum resident set size: 4608 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------