TSTP Solution File: LCL023-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL023-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:23:29 EDT 2023
% Result : Unsatisfiable 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 36 ( 24 unt; 0 nHn; 13 RR)
% Number of literals : 52 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QYA4SmkwIh/E---3.1_11921.p',condensed_detachment) ).
cnf(yql,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.QYA4SmkwIh/E---3.1_11921.p',yql) ).
cnf(prove_ec_2,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
file('/export/starexec/sandbox2/tmp/tmp.QYA4SmkwIh/E---3.1_11921.p',prove_ec_2) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X1,X3)))),
yql ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X3),equivalent(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),equivalent(X1,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,X4),X1)),equivalent(X2,X4))),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X1,X2))),X3))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X2,X3),X1))),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X2,equivalent(X1,X3)),X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X2,X3),equivalent(X1,X3))))),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_18,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(equivalent(X3,X1),X2)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,X2),equivalent(X3,X2))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,equivalent(X3,X2))),X3))),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X1))),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_10,c_0_22]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X1,X2)))),
inference(spm,[status(thm)],[c_0_7,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X1)),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(X4,X2)))
| ~ is_a_theorem(equivalent(X4,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_10,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
prove_ec_2 ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),X4)))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X4)) ),
inference(spm,[status(thm)],[c_0_28,c_0_4]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_7,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(b,equivalent(b,c)),c)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL023-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 11:27:26 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.QYA4SmkwIh/E---3.1_11921.p
% 0.17/0.44 # Version: 3.1pre001
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11998 completed with status 0
% 0.17/0.44 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.17/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.44 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.44 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.17/0.44 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 12008 completed with status 0
% 0.17/0.44 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.17/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.44 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.44 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Unsatisfiable
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 3
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 3
% 0.17/0.44 # Removed in clause preprocessing : 0
% 0.17/0.44 # Initial clauses in saturation : 3
% 0.17/0.44 # Processed clauses : 68
% 0.17/0.44 # ...of these trivial : 1
% 0.17/0.44 # ...subsumed : 3
% 0.17/0.44 # ...remaining for further processing : 64
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 2
% 0.17/0.44 # Generated clauses : 338
% 0.17/0.44 # ...of the previous two non-redundant : 281
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 1
% 0.17/0.44 # Paramodulations : 338
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Total rewrite steps : 43
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 59
% 0.17/0.44 # Positive orientable unit clauses : 31
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 1
% 0.17/0.44 # Non-unit-clauses : 27
% 0.17/0.44 # Current number of unprocessed clauses: 219
% 0.17/0.44 # ...number of literals in the above : 451
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 5
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 151
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 138
% 0.17/0.44 # Non-unit clause-clause subsumptions : 4
% 0.17/0.44 # Unit Clause-clause subsumption calls : 114
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 566
% 0.17/0.44 # BW rewrite match successes : 2
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 4119
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.007 s
% 0.17/0.44 # System time : 0.001 s
% 0.17/0.44 # Total time : 0.008 s
% 0.17/0.44 # Maximum resident set size: 1580 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.035 s
% 0.17/0.44 # System time : 0.004 s
% 0.17/0.44 # Total time : 0.039 s
% 0.17/0.44 # Maximum resident set size: 1676 pages
% 0.17/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------