TSTP Solution File: LCL012-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL012-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:36 EDT 2024
% Result : Unsatisfiable 3.21s 0.87s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 54 ( 21 unt; 0 nHn; 26 RR)
% Number of literals : 98 ( 0 equ; 47 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 : 138 ( 0 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(um,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',um) ).
cnf(prove_yqj,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yqj) ).
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(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1)))),
um ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1))) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_11,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_13,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),X2),X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X1)),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X3))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X3),X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X3),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X2))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_28,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X2)),X3),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_5]) ).
cnf(c_0_30,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X2)),X3))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,X1),X2))),
inference(spm,[status(thm)],[c_0_30,c_0_5]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),X2),X1),X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X2,X3),X1),X3))),
inference(spm,[status(thm)],[c_0_6,c_0_32]) ).
cnf(c_0_35,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X1),X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_36,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X2),equivalent(X3,X1))),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_37,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X2))) ),
inference(spm,[status(thm)],[c_0_30,c_0_10]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),X3),X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_39]) ).
cnf(c_0_42,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(equivalent(X3,X2),X1)),X3))),
inference(spm,[status(thm)],[c_0_35,c_0_5]) ).
cnf(c_0_43,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_44,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X1,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_40]) ).
cnf(c_0_45,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_41]) ).
cnf(c_0_46,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_37,c_0_42]) ).
cnf(c_0_47,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),X3),X2)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))),
inference(fof_simplification,[status(thm)],[prove_yqj]) ).
cnf(c_0_49,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),equivalent(X3,X2))),X3)),
inference(spm,[status(thm)],[c_0_43,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))),
c_0_48 ).
cnf(c_0_52,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : LCL012-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 02:57:53 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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
% 3.21/0.87 # Version: 3.1.0
% 3.21/0.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.21/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.21/0.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.21/0.87 # Starting new_bool_3 with 300s (1) cores
% 3.21/0.87 # Starting new_bool_1 with 300s (1) cores
% 3.21/0.87 # Starting sh5l with 300s (1) cores
% 3.21/0.87 # new_bool_3 with pid 12465 completed with status 0
% 3.21/0.87 # Result found by new_bool_3
% 3.21/0.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.21/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.21/0.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.21/0.87 # Starting new_bool_3 with 300s (1) cores
% 3.21/0.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.21/0.87 # Search class: FHUNF-FFSF22-MFFFFFNN
% 3.21/0.87 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.21/0.87 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 3.21/0.87 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 12475 completed with status 0
% 3.21/0.87 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 3.21/0.87 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.21/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.21/0.87 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.21/0.87 # Starting new_bool_3 with 300s (1) cores
% 3.21/0.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.21/0.87 # Search class: FHUNF-FFSF22-MFFFFFNN
% 3.21/0.87 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.21/0.87 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 3.21/0.87 # Preprocessing time : 0.001 s
% 3.21/0.87
% 3.21/0.87 # Proof found!
% 3.21/0.87 # SZS status Unsatisfiable
% 3.21/0.87 # SZS output start CNFRefutation
% See solution above
% 3.21/0.87 # Parsed axioms : 3
% 3.21/0.87 # Removed by relevancy pruning/SinE : 0
% 3.21/0.87 # Initial clauses : 3
% 3.21/0.87 # Removed in clause preprocessing : 0
% 3.21/0.87 # Initial clauses in saturation : 3
% 3.21/0.87 # Processed clauses : 10204
% 3.21/0.87 # ...of these trivial : 717
% 3.21/0.87 # ...subsumed : 8634
% 3.21/0.87 # ...remaining for further processing : 853
% 3.21/0.87 # Other redundant clauses eliminated : 0
% 3.21/0.87 # Clauses deleted for lack of memory : 0
% 3.21/0.87 # Backward-subsumed : 1
% 3.21/0.87 # Backward-rewritten : 1
% 3.21/0.87 # Generated clauses : 62165
% 3.21/0.87 # ...of the previous two non-redundant : 34368
% 3.21/0.87 # ...aggressively subsumed : 0
% 3.21/0.87 # Contextual simplify-reflections : 0
% 3.21/0.87 # Paramodulations : 62165
% 3.21/0.87 # Factorizations : 0
% 3.21/0.87 # NegExts : 0
% 3.21/0.87 # Equation resolutions : 0
% 3.21/0.87 # Disequality decompositions : 0
% 3.21/0.87 # Total rewrite steps : 28901
% 3.21/0.87 # ...of those cached : 28319
% 3.21/0.87 # Propositional unsat checks : 0
% 3.21/0.87 # Propositional check models : 0
% 3.21/0.87 # Propositional check unsatisfiable : 0
% 3.21/0.87 # Propositional clauses : 0
% 3.21/0.87 # Propositional clauses after purity: 0
% 3.21/0.87 # Propositional unsat core size : 0
% 3.21/0.87 # Propositional preprocessing time : 0.000
% 3.21/0.87 # Propositional encoding time : 0.000
% 3.21/0.87 # Propositional solver time : 0.000
% 3.21/0.87 # Success case prop preproc time : 0.000
% 3.21/0.87 # Success case prop encoding time : 0.000
% 3.21/0.87 # Success case prop solver time : 0.000
% 3.21/0.87 # Current number of processed clauses : 851
% 3.21/0.87 # Positive orientable unit clauses : 536
% 3.21/0.87 # Positive unorientable unit clauses: 0
% 3.21/0.87 # Negative unit clauses : 0
% 3.21/0.87 # Non-unit-clauses : 315
% 3.21/0.87 # Current number of unprocessed clauses: 24161
% 3.21/0.87 # ...number of literals in the above : 44785
% 3.21/0.87 # Current number of archived formulas : 0
% 3.21/0.87 # Current number of archived clauses : 2
% 3.21/0.87 # Clause-clause subsumption calls (NU) : 247834
% 3.21/0.87 # Rec. Clause-clause subsumption calls : 247834
% 3.21/0.87 # Non-unit clause-clause subsumptions : 8635
% 3.21/0.87 # Unit Clause-clause subsumption calls : 615
% 3.21/0.87 # Rewrite failures with RHS unbound : 0
% 3.21/0.87 # BW rewrite match attempts : 126384
% 3.21/0.87 # BW rewrite match successes : 1
% 3.21/0.87 # Condensation attempts : 0
% 3.21/0.87 # Condensation successes : 0
% 3.21/0.87 # Termbank termtop insertions : 574675
% 3.21/0.87 # Search garbage collected termcells : 8
% 3.21/0.87
% 3.21/0.87 # -------------------------------------------------
% 3.21/0.87 # User time : 0.355 s
% 3.21/0.87 # System time : 0.013 s
% 3.21/0.87 # Total time : 0.368 s
% 3.21/0.87 # Maximum resident set size: 1620 pages
% 3.21/0.87
% 3.21/0.87 # -------------------------------------------------
% 3.21/0.87 # User time : 0.355 s
% 3.21/0.87 # System time : 0.016 s
% 3.21/0.87 # Total time : 0.370 s
% 3.21/0.87 # Maximum resident set size: 1692 pages
% 3.21/0.87 % E---3.1 exiting
% 3.21/0.88 % E exiting
%------------------------------------------------------------------------------