TSTP Solution File: PUZ005+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ005+1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 18:10:40 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 4 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 122 ( 55 ~; 48 |; 6 &)
% ( 0 <=>; 13 =>; 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 : 45 ( 1 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_there_are_close_lying_days,conjecture,
? [X1] :
( day(X1)
& lies_on_one_of(a_lion,X1,yesterday(X1))
& lies_on_one_of(a_unicorn,X1,yesterday(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_there_are_close_lying_days) ).
fof(unicorn_lies_on_both,axiom,
! [X1] :
( day(X1)
=> ! [X2] :
( day(X2)
=> ( ( unicorn_lies(X1)
& ~ lies_on_one_of(a_unicorn,X1,X2) )
=> unicorn_lies(X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',unicorn_lies_on_both) ).
fof(unicorn_lies_on_a_day,axiom,
! [X1] :
( unicorn_lies(X1)
=> day(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',unicorn_lies_on_a_day) ).
fof(lion_lies_on_neither,axiom,
! [X1] :
( day(X1)
=> ! [X2] :
( day(X2)
=> ( ( ~ lion_lies(X1)
& ~ lies_on_one_of(a_lion,X1,X2) )
=> ~ lion_lies(X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lion_lies_on_neither) ).
fof(lion_lies_on_a_day,axiom,
! [X1] :
( lion_lies(X1)
=> day(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lion_lies_on_a_day) ).
fof(unicorn_does_not_lie_wednesday,axiom,
! [X1] :
( wednesday(X1)
=> ~ unicorn_lies(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',unicorn_does_not_lie_wednesday) ).
fof(lion_lies_wednesday,axiom,
! [X1] :
( wednesday(X1)
=> lion_lies(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lion_lies_wednesday) ).
fof(thursday_follows_wednesday,axiom,
! [X1] :
( thursday(X1)
=> wednesday(yesterday(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thursday_follows_wednesday) ).
fof(unicorn_lies_thursday,axiom,
! [X1] :
( thursday(X1)
=> unicorn_lies(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',unicorn_lies_thursday) ).
fof(lion_does_not_lie_thursday,axiom,
! [X1] :
( thursday(X1)
=> ~ lion_lies(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lion_does_not_lie_thursday) ).
fof(thursday,axiom,
thursday(a_thursday),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thursday) ).
fof(c_0_11,negated_conjecture,
~ ? [X1] :
( day(X1)
& lies_on_one_of(a_lion,X1,yesterday(X1))
& lies_on_one_of(a_unicorn,X1,yesterday(X1)) ),
inference(assume_negation,[status(cth)],[prove_there_are_close_lying_days]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ day(X3)
| ~ day(X4)
| ~ unicorn_lies(X3)
| lies_on_one_of(a_unicorn,X3,X4)
| unicorn_lies(X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[unicorn_lies_on_both])])])])])]) ).
fof(c_0_13,plain,
! [X2] :
( ~ unicorn_lies(X2)
| day(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unicorn_lies_on_a_day])]) ).
fof(c_0_14,negated_conjecture,
! [X2] :
( ~ day(X2)
| ~ lies_on_one_of(a_lion,X2,yesterday(X2))
| ~ lies_on_one_of(a_unicorn,X2,yesterday(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_15,plain,
( unicorn_lies(X1)
| lies_on_one_of(a_unicorn,X2,X1)
| ~ unicorn_lies(X2)
| ~ day(X1)
| ~ day(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( day(X1)
| ~ unicorn_lies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ day(X3)
| ~ day(X4)
| lion_lies(X3)
| lies_on_one_of(a_lion,X3,X4)
| ~ lion_lies(X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[lion_lies_on_neither])])])])])]) ).
fof(c_0_18,plain,
! [X2] :
( ~ lion_lies(X2)
| day(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lion_lies_on_a_day])]) ).
cnf(c_0_19,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_14]) ).
cnf(c_0_20,plain,
( lies_on_one_of(a_unicorn,X1,X2)
| unicorn_lies(X2)
| ~ unicorn_lies(X1)
| ~ day(X2) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( lies_on_one_of(a_lion,X2,X1)
| lion_lies(X2)
| ~ lion_lies(X1)
| ~ day(X1)
| ~ day(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( day(X1)
| ~ lion_lies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X2] :
( ~ wednesday(X2)
| ~ unicorn_lies(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[unicorn_does_not_lie_wednesday])])]) ).
cnf(c_0_24,negated_conjecture,
( unicorn_lies(yesterday(X1))
| ~ lies_on_one_of(a_lion,X1,yesterday(X1))
| ~ unicorn_lies(X1)
| ~ day(yesterday(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
cnf(c_0_25,plain,
( lies_on_one_of(a_lion,X1,X2)
| lion_lies(X1)
| ~ lion_lies(X2)
| ~ day(X1) ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,plain,
! [X2] :
( ~ wednesday(X2)
| lion_lies(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lion_lies_wednesday])]) ).
cnf(c_0_27,plain,
( ~ unicorn_lies(X1)
| ~ wednesday(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( unicorn_lies(yesterday(X1))
| lion_lies(X1)
| ~ unicorn_lies(X1)
| ~ lion_lies(yesterday(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_22]) ).
cnf(c_0_29,plain,
( lion_lies(X1)
| ~ wednesday(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_30,plain,
! [X2] :
( ~ thursday(X2)
| wednesday(yesterday(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[thursday_follows_wednesday])]) ).
fof(c_0_31,plain,
! [X2] :
( ~ thursday(X2)
| unicorn_lies(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unicorn_lies_thursday])]) ).
fof(c_0_32,plain,
! [X2] :
( ~ thursday(X2)
| ~ lion_lies(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[lion_does_not_lie_thursday])])]) ).
cnf(c_0_33,negated_conjecture,
( lion_lies(X1)
| ~ unicorn_lies(X1)
| ~ wednesday(yesterday(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,plain,
( wednesday(yesterday(X1))
| ~ thursday(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( unicorn_lies(X1)
| ~ thursday(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( ~ lion_lies(X1)
| ~ thursday(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
thursday(a_thursday),
inference(split_conjunct,[status(thm)],[thursday]) ).
cnf(c_0_38,negated_conjecture,
~ thursday(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[c_0_37,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ005+1 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat May 28 22:14:39 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 40
% 0.22/1.40 # Proof object clause steps : 18
% 0.22/1.40 # Proof object formula steps : 22
% 0.22/1.40 # Proof object conjectures : 8
% 0.22/1.40 # Proof object clause conjectures : 5
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 11
% 0.22/1.40 # Proof object initial formulas used : 11
% 0.22/1.40 # Proof object generating inferences : 4
% 0.22/1.40 # Proof object simplifying inferences : 9
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 46
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 46
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 46
% 0.22/1.40 # Processed clauses : 167
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 44
% 0.22/1.40 # ...remaining for further processing : 123
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 136
% 0.22/1.40 # ...of the previous two non-trivial : 121
% 0.22/1.40 # Contextual simplify-reflections : 51
% 0.22/1.40 # Paramodulations : 135
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 122
% 0.22/1.40 # Positive orientable unit clauses : 6
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 22
% 0.22/1.40 # Non-unit-clauses : 94
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 1
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 2964
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 1706
% 0.22/1.40 # Non-unit clause-clause subsumptions : 95
% 0.22/1.40 # Unit Clause-clause subsumption calls : 893
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 4143
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.020 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.021 s
% 0.22/1.40 # Maximum resident set size: 2900 pages
% 0.22/16.34 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.34 eprover: No such file or directory
% 0.22/16.35 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.35 eprover: No such file or directory
% 0.22/16.36 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.36 eprover: No such file or directory
% 0.22/16.36 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.36 eprover: No such file or directory
% 0.22/16.37 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.37 eprover: No such file or directory
% 0.22/16.37 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.37 eprover: No such file or directory
% 0.22/16.38 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.38 eprover: No such file or directory
% 0.22/16.38 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.38 eprover: No such file or directory
% 0.22/16.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.39 eprover: No such file or directory
% 0.22/16.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.40 eprover: No such file or directory
% 0.22/16.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/16.40 eprover: No such file or directory
%------------------------------------------------------------------------------