TSTP Solution File: LCL129-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL129-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 300s
% DateTime : Mon May 20 23:45:06 EDT 2024
% Result : Unsatisfiable 15.88s 2.47s
% Output : CNFRefutation 15.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 45 ( 13 unt; 0 nHn; 32 RR)
% Number of literals : 93 ( 0 equ; 61 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 119 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(s_4,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_4) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(c_0_3,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_4,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))),
s_4 ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X4,X2)))
| ~ is_a_theorem(equivalent(X1,equivalent(X4,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X4)))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X4))) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X2,equivalent(X4,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X5,X3)),equivalent(X4,equivalent(X5,X2)))) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X5,equivalent(X4,X2))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_15,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
inference(fof_simplification,[status(thm)],[prove_lg_2]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X1,X4),X5)))
| ~ is_a_theorem(equivalent(X6,equivalent(X2,X4)))
| ~ is_a_theorem(equivalent(X3,equivalent(X6,X5))) ),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_20,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
c_0_18 ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X4))))
| ~ is_a_theorem(equivalent(X5,equivalent(equivalent(X1,equivalent(X6,X3)),X7)))
| ~ is_a_theorem(equivalent(X5,equivalent(equivalent(X2,equivalent(X6,X4)),X7))) ),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_24,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),equivalent(X1,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(a,equivalent(X2,equivalent(equivalent(b,e),equivalent(c,e)))),X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(a,equivalent(X2,equivalent(b,c))),X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_5]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X4))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X5,X4)),equivalent(X1,equivalent(X5,X3)))) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(X2,equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(equivalent(a,equivalent(X2,equivalent(b,c))),X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2)))),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(X2,equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(X2,equivalent(b,c))))) ),
inference(spm,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_32,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3)))) ),
inference(spm,[status(thm)],[c_0_7,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(equivalent(X2,X2),equivalent(a,equivalent(X1,equivalent(b,c))))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(b,c)),X2),equivalent(a,X2))) ),
inference(spm,[status(thm)],[c_0_33,c_0_6]) ).
cnf(c_0_36,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X3))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_37,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(equivalent(a,equivalent(X2,X2)),equivalent(X1,equivalent(b,c)))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(a,equivalent(c,b)),equivalent(equivalent(b,e),equivalent(c,e))))),
inference(spm,[status(thm)],[c_0_37,c_0_5]) ).
cnf(c_0_39,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(X4,X3)))
| ~ is_a_theorem(equivalent(X4,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_40,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(c,b)))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X4))) ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_42,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(c,e)),equivalent(a,equivalent(c,b)))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_27]) ).
cnf(c_0_43,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(c,b)),equivalent(X1,equivalent(c,e)))),
inference(spm,[status(thm)],[c_0_42,c_0_21]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_43,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL129-1 : TPTP v8.2.0. Released v1.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 00:45:52 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 15.88/2.47 # Version: 3.1.0
% 15.88/2.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.88/2.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.88/2.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.88/2.47 # Starting new_bool_3 with 300s (1) cores
% 15.88/2.47 # Starting new_bool_1 with 300s (1) cores
% 15.88/2.47 # Starting sh5l with 300s (1) cores
% 15.88/2.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6039 completed with status 0
% 15.88/2.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 15.88/2.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.88/2.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.88/2.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.88/2.47 # No SInE strategy applied
% 15.88/2.47 # Search class: FHUNF-FFSF22-MFFFFFNN
% 15.88/2.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 15.88/2.47 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 15.88/2.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.88/2.47 # Starting new_bool_3 with 136s (1) cores
% 15.88/2.47 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 15.88/2.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 15.88/2.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 6050 completed with status 0
% 15.88/2.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 15.88/2.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.88/2.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.88/2.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.88/2.47 # No SInE strategy applied
% 15.88/2.47 # Search class: FHUNF-FFSF22-MFFFFFNN
% 15.88/2.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 15.88/2.47 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 15.88/2.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.88/2.47 # Starting new_bool_3 with 136s (1) cores
% 15.88/2.47 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 15.88/2.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 15.88/2.47 # Preprocessing time : 0.001 s
% 15.88/2.47 # Presaturation interreduction done
% 15.88/2.47
% 15.88/2.47 # Proof found!
% 15.88/2.47 # SZS status Unsatisfiable
% 15.88/2.47 # SZS output start CNFRefutation
% See solution above
% 15.88/2.47 # Parsed axioms : 3
% 15.88/2.47 # Removed by relevancy pruning/SinE : 0
% 15.88/2.47 # Initial clauses : 3
% 15.88/2.47 # Removed in clause preprocessing : 0
% 15.88/2.47 # Initial clauses in saturation : 3
% 15.88/2.47 # Processed clauses : 2524
% 15.88/2.47 # ...of these trivial : 2
% 15.88/2.47 # ...subsumed : 2009
% 15.88/2.47 # ...remaining for further processing : 513
% 15.88/2.47 # Other redundant clauses eliminated : 0
% 15.88/2.47 # Clauses deleted for lack of memory : 0
% 15.88/2.47 # Backward-subsumed : 80
% 15.88/2.47 # Backward-rewritten : 1
% 15.88/2.47 # Generated clauses : 74215
% 15.88/2.47 # ...of the previous two non-redundant : 73697
% 15.88/2.47 # ...aggressively subsumed : 0
% 15.88/2.47 # Contextual simplify-reflections : 7
% 15.88/2.47 # Paramodulations : 74215
% 15.88/2.47 # Factorizations : 0
% 15.88/2.47 # NegExts : 0
% 15.88/2.47 # Equation resolutions : 0
% 15.88/2.47 # Disequality decompositions : 0
% 15.88/2.47 # Total rewrite steps : 929
% 15.88/2.47 # ...of those cached : 903
% 15.88/2.47 # Propositional unsat checks : 0
% 15.88/2.47 # Propositional check models : 0
% 15.88/2.47 # Propositional check unsatisfiable : 0
% 15.88/2.47 # Propositional clauses : 0
% 15.88/2.47 # Propositional clauses after purity: 0
% 15.88/2.47 # Propositional unsat core size : 0
% 15.88/2.47 # Propositional preprocessing time : 0.000
% 15.88/2.47 # Propositional encoding time : 0.000
% 15.88/2.47 # Propositional solver time : 0.000
% 15.88/2.47 # Success case prop preproc time : 0.000
% 15.88/2.47 # Success case prop encoding time : 0.000
% 15.88/2.47 # Success case prop solver time : 0.000
% 15.88/2.47 # Current number of processed clauses : 429
% 15.88/2.47 # Positive orientable unit clauses : 6
% 15.88/2.47 # Positive unorientable unit clauses: 0
% 15.88/2.47 # Negative unit clauses : 26
% 15.88/2.47 # Non-unit-clauses : 397
% 15.88/2.47 # Current number of unprocessed clauses: 71025
% 15.88/2.47 # ...number of literals in the above : 423389
% 15.88/2.47 # Current number of archived formulas : 0
% 15.88/2.47 # Current number of archived clauses : 84
% 15.88/2.47 # Clause-clause subsumption calls (NU) : 122567
% 15.88/2.47 # Rec. Clause-clause subsumption calls : 55844
% 15.88/2.47 # Non-unit clause-clause subsumptions : 1467
% 15.88/2.47 # Unit Clause-clause subsumption calls : 3130
% 15.88/2.47 # Rewrite failures with RHS unbound : 0
% 15.88/2.47 # BW rewrite match attempts : 187
% 15.88/2.47 # BW rewrite match successes : 2
% 15.88/2.47 # Condensation attempts : 0
% 15.88/2.47 # Condensation successes : 0
% 15.88/2.47 # Termbank termtop insertions : 1968023
% 15.88/2.47 # Search garbage collected termcells : 8
% 15.88/2.47
% 15.88/2.47 # -------------------------------------------------
% 15.88/2.47 # User time : 1.934 s
% 15.88/2.47 # System time : 0.063 s
% 15.88/2.47 # Total time : 1.997 s
% 15.88/2.47 # Maximum resident set size: 1644 pages
% 15.88/2.47
% 15.88/2.47 # -------------------------------------------------
% 15.88/2.47 # User time : 9.718 s
% 15.88/2.47 # System time : 0.242 s
% 15.88/2.47 # Total time : 9.960 s
% 15.88/2.47 # Maximum resident set size: 1696 pages
% 15.88/2.47 % E---3.1 exiting
% 15.88/2.47 % E exiting
%------------------------------------------------------------------------------