TSTP Solution File: LCL096-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL096-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Mon May 20 23:44:56 EDT 2024
% Result : Unsatisfiable 64.93s 8.68s
% Output : CNFRefutation 64.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 36 ( 18 unt; 0 nHn; 21 RR)
% Number of literals : 60 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 106 ( 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/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_3) ).
cnf(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).
cnf(lg_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_4) ).
cnf(prove_lg_1,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_1) ).
cnf(c_0_5,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_6,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
lg_3 ).
cnf(c_0_8,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
lg_2 ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5),equivalent(equivalent(X3,X4),X5)),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))),
lg_4 ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),X5)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X4),X3),X5)) ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X3),X1),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X2),X1),X4)) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
inference(fof_simplification,[status(thm)],[prove_lg_1]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
c_0_22 ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X5,X2),X6),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X5),X3),X6)) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(b,b),a)),X2),c))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,X1),c),X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(b,b),a)),equivalent(equivalent(X2,X2),equivalent(equivalent(a,X1),c))),c)),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_29,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X5),X1),equivalent(X5,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),a),equivalent(equivalent(a,equivalent(X1,X1)),c)),c)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)),equivalent(equivalent(X3,X2),X4))),
inference(spm,[status(thm)],[c_0_29,c_0_8]) ).
cnf(c_0_32,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),a),equivalent(equivalent(a,equivalent(X1,X1)),c)),X2))
| ~ is_a_theorem(equivalent(X2,c)) ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),a),equivalent(equivalent(a,equivalent(X1,X1)),c)),equivalent(equivalent(X2,X2),c))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_34,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL096-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 01:22:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 64.93/8.68 # Version: 3.1.0
% 64.93/8.68 # Preprocessing class: FSSSSMSSSSSNFFN.
% 64.93/8.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.93/8.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 64.93/8.68 # Starting new_bool_3 with 300s (1) cores
% 64.93/8.68 # Starting new_bool_1 with 300s (1) cores
% 64.93/8.68 # Starting sh5l with 300s (1) cores
% 64.93/8.68 # new_bool_3 with pid 8531 completed with status 0
% 64.93/8.68 # Result found by new_bool_3
% 64.93/8.68 # Preprocessing class: FSSSSMSSSSSNFFN.
% 64.93/8.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.93/8.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 64.93/8.68 # Starting new_bool_3 with 300s (1) cores
% 64.93/8.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 64.93/8.68 # Search class: FHUNS-FFSF22-DFFFFFNN
% 64.93/8.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 64.93/8.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S3b with 181s (1) cores
% 64.93/8.68 # G-E--_208_C18_F1_SE_CS_SP_PS_S3b with pid 8537 completed with status 0
% 64.93/8.68 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S3b
% 64.93/8.68 # Preprocessing class: FSSSSMSSSSSNFFN.
% 64.93/8.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.93/8.68 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 64.93/8.68 # Starting new_bool_3 with 300s (1) cores
% 64.93/8.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 64.93/8.68 # Search class: FHUNS-FFSF22-DFFFFFNN
% 64.93/8.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 64.93/8.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S3b with 181s (1) cores
% 64.93/8.68 # Preprocessing time : 0.001 s
% 64.93/8.68 # Presaturation interreduction done
% 64.93/8.68
% 64.93/8.68 # Proof found!
% 64.93/8.68 # SZS status Unsatisfiable
% 64.93/8.68 # SZS output start CNFRefutation
% See solution above
% 64.93/8.68 # Parsed axioms : 5
% 64.93/8.68 # Removed by relevancy pruning/SinE : 0
% 64.93/8.68 # Initial clauses : 5
% 64.93/8.68 # Removed in clause preprocessing : 0
% 64.93/8.68 # Initial clauses in saturation : 5
% 64.93/8.68 # Processed clauses : 15182
% 64.93/8.68 # ...of these trivial : 16
% 64.93/8.68 # ...subsumed : 12275
% 64.93/8.68 # ...remaining for further processing : 2891
% 64.93/8.68 # Other redundant clauses eliminated : 0
% 64.93/8.68 # Clauses deleted for lack of memory : 0
% 64.93/8.68 # Backward-subsumed : 48
% 64.93/8.68 # Backward-rewritten : 1
% 64.93/8.68 # Generated clauses : 446779
% 64.93/8.68 # ...of the previous two non-redundant : 439678
% 64.93/8.68 # ...aggressively subsumed : 0
% 64.93/8.68 # Contextual simplify-reflections : 0
% 64.93/8.68 # Paramodulations : 446779
% 64.93/8.68 # Factorizations : 0
% 64.93/8.68 # NegExts : 0
% 64.93/8.68 # Equation resolutions : 0
% 64.93/8.68 # Disequality decompositions : 0
% 64.93/8.68 # Total rewrite steps : 22157
% 64.93/8.68 # ...of those cached : 21884
% 64.93/8.68 # Propositional unsat checks : 0
% 64.93/8.68 # Propositional check models : 0
% 64.93/8.68 # Propositional check unsatisfiable : 0
% 64.93/8.68 # Propositional clauses : 0
% 64.93/8.68 # Propositional clauses after purity: 0
% 64.93/8.68 # Propositional unsat core size : 0
% 64.93/8.68 # Propositional preprocessing time : 0.000
% 64.93/8.68 # Propositional encoding time : 0.000
% 64.93/8.68 # Propositional solver time : 0.000
% 64.93/8.68 # Success case prop preproc time : 0.000
% 64.93/8.68 # Success case prop encoding time : 0.000
% 64.93/8.68 # Success case prop solver time : 0.000
% 64.93/8.68 # Current number of processed clauses : 2837
% 64.93/8.68 # Positive orientable unit clauses : 101
% 64.93/8.68 # Positive unorientable unit clauses: 0
% 64.93/8.68 # Negative unit clauses : 124
% 64.93/8.68 # Non-unit-clauses : 2612
% 64.93/8.68 # Current number of unprocessed clauses: 424345
% 64.93/8.68 # ...number of literals in the above : 1674568
% 64.93/8.68 # Current number of archived formulas : 0
% 64.93/8.68 # Current number of archived clauses : 54
% 64.93/8.68 # Clause-clause subsumption calls (NU) : 4316644
% 64.93/8.68 # Rec. Clause-clause subsumption calls : 1179040
% 64.93/8.68 # Non-unit clause-clause subsumptions : 10584
% 64.93/8.68 # Unit Clause-clause subsumption calls : 70973
% 64.93/8.68 # Rewrite failures with RHS unbound : 0
% 64.93/8.68 # BW rewrite match attempts : 42293
% 64.93/8.68 # BW rewrite match successes : 1
% 64.93/8.68 # Condensation attempts : 0
% 64.93/8.68 # Condensation successes : 0
% 64.93/8.68 # Termbank termtop insertions : 11197024
% 64.93/8.68 # Search garbage collected termcells : 8
% 64.93/8.68
% 64.93/8.68 # -------------------------------------------------
% 64.93/8.68 # User time : 7.772 s
% 64.93/8.68 # System time : 0.239 s
% 64.93/8.68 # Total time : 8.011 s
% 64.93/8.68 # Maximum resident set size: 1632 pages
% 64.93/8.68
% 64.93/8.68 # -------------------------------------------------
% 64.93/8.68 # User time : 7.772 s
% 64.93/8.68 # System time : 0.243 s
% 64.93/8.68 # Total time : 8.014 s
% 64.93/8.68 # Maximum resident set size: 1696 pages
% 64.93/8.68 % E---3.1 exiting
% 64.93/8.68 % E exiting
%------------------------------------------------------------------------------