TSTP Solution File: LCL034-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL034-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:23:31 EDT 2023
% Result : Unsatisfiable 1.41s 0.67s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 3
% Syntax : Number of clauses : 59 ( 37 unt; 0 nHn; 8 RR)
% Number of literals : 83 ( 0 equ; 26 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 : 182 ( 99 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.2YCNDehuy3/E---3.1_19280.p',condensed_detachment) ).
cnf(c0_CAMerideth,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
file('/export/starexec/sandbox/tmp/tmp.2YCNDehuy3/E---3.1_19280.p',c0_CAMerideth) ).
cnf(prove_c0_3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox/tmp/tmp.2YCNDehuy3/E---3.1_19280.p',prove_c0_3) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
c0_CAMerideth ).
cnf(c_0_5,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(implies(implies(implies(X2,X4),implies(X3,falsehood)),X5),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(implies(X1,implies(falsehood,X2)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(falsehood,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(implies(X4,X2),implies(X5,X2)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(implies(falsehood,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(X1,implies(falsehood,implies(X2,falsehood)))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(falsehood,implies(X1,falsehood)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(falsehood,implies(X1,falsehood))),
inference(spm,[status(thm)],[c_0_13,c_0_4]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,implies(falsehood,X4)),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_17]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(implies(X2,X3),implies(X4,falsehood)),X5)),X2),implies(X4,X2))),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(X2,implies(falsehood,X3)))),
inference(spm,[status(thm)],[c_0_18,c_0_6]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X1)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X4,X3)))
| ~ is_a_theorem(implies(implies(X3,X5),implies(X4,falsehood))) ),
inference(spm,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(X2,X4),implies(X1,falsehood)),X3))),
inference(spm,[status(thm)],[c_0_5,c_0_20]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(falsehood,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,implies(X4,X3)),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(implies(implies(X4,X5),implies(X3,falsehood)),implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,implies(falsehood,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_4]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),X4),implies(X5,falsehood)),implies(X5,implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(falsehood,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_28]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(implies(implies(X1,X2),X3),implies(X4,falsehood)),implies(X4,implies(X1,X2))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(falsehood,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_4]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X3),implies(X4,falsehood)),implies(X4,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X2),implies(X4,X2))),
inference(spm,[status(thm)],[c_0_5,c_0_33]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_34]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(implies(implies(X1,falsehood),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_35]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_5,c_0_36]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X2,X3),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_37]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_5,c_0_39]) ).
cnf(c_0_41,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X3),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_40]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),implies(X4,falsehood)),implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X2,falsehood),X3)))),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X3,X1)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,implies(implies(X1,falsehood),X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_43]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_47,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(X1,falsehood),X3),X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_36]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(X1,implies(implies(X1,falsehood),X2))),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X2,X3),implies(X1,falsehood))) ),
inference(spm,[status(thm)],[c_0_3,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X1,falsehood),X2),falsehood),X3))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),falsehood),X3),falsehood),X1)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_51]) ).
cnf(c_0_53,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_52]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
inference(spm,[status(thm)],[c_0_53,c_0_37]) ).
cnf(c_0_55,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
prove_c0_3 ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_55,c_0_32]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL034-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 12:33:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.2YCNDehuy3/E---3.1_19280.p
% 1.41/0.67 # Version: 3.1pre001
% 1.41/0.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.41/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.41/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.41/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.41/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.41/0.67 # Starting sh5l with 300s (1) cores
% 1.41/0.67 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19381 completed with status 0
% 1.41/0.67 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.41/0.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.41/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.41/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.41/0.67 # No SInE strategy applied
% 1.41/0.67 # Search class: FHUNF-FFSF22-MFFFFFNN
% 1.41/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.41/0.67 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 1.41/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.41/0.67 # Starting new_bool_3 with 136s (1) cores
% 1.41/0.67 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.41/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 1.41/0.67 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 19390 completed with status 0
% 1.41/0.67 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.41/0.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.41/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.41/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.41/0.67 # No SInE strategy applied
% 1.41/0.67 # Search class: FHUNF-FFSF22-MFFFFFNN
% 1.41/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.41/0.67 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 1.41/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.41/0.67 # Starting new_bool_3 with 136s (1) cores
% 1.41/0.67 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.41/0.67 # Preprocessing time : 0.001 s
% 1.41/0.67 # Presaturation interreduction done
% 1.41/0.67
% 1.41/0.67 # Proof found!
% 1.41/0.67 # SZS status Unsatisfiable
% 1.41/0.67 # SZS output start CNFRefutation
% See solution above
% 1.41/0.67 # Parsed axioms : 3
% 1.41/0.67 # Removed by relevancy pruning/SinE : 0
% 1.41/0.67 # Initial clauses : 3
% 1.41/0.67 # Removed in clause preprocessing : 0
% 1.41/0.67 # Initial clauses in saturation : 3
% 1.41/0.67 # Processed clauses : 1898
% 1.41/0.67 # ...of these trivial : 457
% 1.41/0.67 # ...subsumed : 1016
% 1.41/0.67 # ...remaining for further processing : 425
% 1.41/0.67 # Other redundant clauses eliminated : 0
% 1.41/0.67 # Clauses deleted for lack of memory : 0
% 1.41/0.67 # Backward-subsumed : 9
% 1.41/0.67 # Backward-rewritten : 45
% 1.41/0.67 # Generated clauses : 17063
% 1.41/0.67 # ...of the previous two non-redundant : 11362
% 1.41/0.67 # ...aggressively subsumed : 0
% 1.41/0.67 # Contextual simplify-reflections : 0
% 1.41/0.67 # Paramodulations : 17063
% 1.41/0.67 # Factorizations : 0
% 1.41/0.67 # NegExts : 0
% 1.41/0.67 # Equation resolutions : 0
% 1.41/0.67 # Total rewrite steps : 6146
% 1.41/0.67 # Propositional unsat checks : 0
% 1.41/0.67 # Propositional check models : 0
% 1.41/0.67 # Propositional check unsatisfiable : 0
% 1.41/0.67 # Propositional clauses : 0
% 1.41/0.67 # Propositional clauses after purity: 0
% 1.41/0.67 # Propositional unsat core size : 0
% 1.41/0.67 # Propositional preprocessing time : 0.000
% 1.41/0.67 # Propositional encoding time : 0.000
% 1.41/0.67 # Propositional solver time : 0.000
% 1.41/0.67 # Success case prop preproc time : 0.000
% 1.41/0.67 # Success case prop encoding time : 0.000
% 1.41/0.67 # Success case prop solver time : 0.000
% 1.41/0.67 # Current number of processed clauses : 368
% 1.41/0.67 # Positive orientable unit clauses : 236
% 1.41/0.67 # Positive unorientable unit clauses: 0
% 1.41/0.67 # Negative unit clauses : 1
% 1.41/0.67 # Non-unit-clauses : 131
% 1.41/0.67 # Current number of unprocessed clauses: 7261
% 1.41/0.67 # ...number of literals in the above : 10948
% 1.41/0.67 # Current number of archived formulas : 0
% 1.41/0.67 # Current number of archived clauses : 57
% 1.41/0.67 # Clause-clause subsumption calls (NU) : 9229
% 1.41/0.67 # Rec. Clause-clause subsumption calls : 9137
% 1.41/0.67 # Non-unit clause-clause subsumptions : 1025
% 1.41/0.67 # Unit Clause-clause subsumption calls : 554
% 1.41/0.67 # Rewrite failures with RHS unbound : 0
% 1.41/0.67 # BW rewrite match attempts : 25482
% 1.41/0.67 # BW rewrite match successes : 45
% 1.41/0.67 # Condensation attempts : 0
% 1.41/0.67 # Condensation successes : 0
% 1.41/0.67 # Termbank termtop insertions : 205738
% 1.41/0.67
% 1.41/0.67 # -------------------------------------------------
% 1.41/0.67 # User time : 0.154 s
% 1.41/0.67 # System time : 0.012 s
% 1.41/0.67 # Total time : 0.166 s
% 1.41/0.67 # Maximum resident set size: 1576 pages
% 1.41/0.67
% 1.41/0.67 # -------------------------------------------------
% 1.41/0.67 # User time : 0.786 s
% 1.41/0.67 # System time : 0.027 s
% 1.41/0.67 # Total time : 0.813 s
% 1.41/0.67 # Maximum resident set size: 1672 pages
% 1.41/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------