TSTP Solution File: LCL090-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL090-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:42 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 3
% Syntax : Number of clauses : 43 ( 27 unt; 0 nHn; 5 RR)
% Number of literals : 61 ( 0 equ; 20 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 : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 174 ( 107 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.wFgn9wX6zk/E---3.1_28103.p',condensed_detachment) ).
cnf(ic_JLukasiewicz_5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(implies(X4,X1),implies(X5,implies(X3,X1))))),
file('/export/starexec/sandbox/tmp/tmp.wFgn9wX6zk/E---3.1_28103.p',ic_JLukasiewicz_5) ).
cnf(prove_ic_1,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox/tmp/tmp.wFgn9wX6zk/E---3.1_28103.p',prove_ic_1) ).
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(X1,X2),implies(X3,X4)),implies(implies(X4,X1),implies(X5,implies(X3,X1))))),
ic_JLukasiewicz_5 ).
cnf(c_0_5,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X4,X2))))
| ~ is_a_theorem(implies(implies(X2,X5),implies(X4,X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X3,X4)),implies(X5,implies(implies(X6,X3),implies(X3,X4))))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X4))))
| ~ is_a_theorem(implies(implies(X5,implies(X6,X3)),implies(X3,X4))) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(implies(X4,X5),implies(X5,X3)))))),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X2,X3)),implies(X4,implies(X5,X2))),implies(X6,implies(X7,implies(X4,implies(X5,X2)))))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,implies(X3,X4))),implies(implies(X5,X4),implies(X4,X6))),implies(X7,implies(X8,implies(implies(X5,X4),implies(X4,X6)))))),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X2,X3)),X4),implies(X5,implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,implies(X2,implies(implies(X3,X4),implies(X4,X5)))))
| ~ is_a_theorem(implies(implies(X6,implies(X7,implies(X8,X4))),implies(implies(X3,X4),implies(X4,X5)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(X4,implies(X5,X3)))))),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X4),implies(X4,implies(X5,X4)))))),
inference(spm,[status(thm)],[c_0_14,c_0_4]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X3),implies(X3,implies(X4,X3)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X3),implies(X3,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_18,c_0_4]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(X5,implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(X3,X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,implies(X4,X1))),implies(X5,implies(X6,implies(X3,implies(X4,X1)))))),
inference(spm,[status(thm)],[c_0_5,c_0_21]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_22,c_0_4]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X5)))))
| ~ is_a_theorem(implies(implies(X5,X6),implies(X3,implies(X4,X5)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X4,implies(X2,implies(X3,X2))))),
inference(spm,[status(thm)],[c_0_5,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,implies(X5,X4)))))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X3)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_3,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_28,c_0_4]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X2))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_29]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_30,c_0_4]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_31]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_32,c_0_4]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X4))))),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X3))))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_34]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_35,c_0_4]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(X1,implies(X2,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_36]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_37,c_0_4]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
~ is_a_theorem(implies(a,a)),
prove_ic_1 ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_4]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL090-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 11:58:39 EDT 2023
% 0.13/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.wFgn9wX6zk/E---3.1_28103.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28212 completed with status 0
% 0.21/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.21/0.54 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 28221 completed with status 0
% 0.21/0.54 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # No SInE strategy applied
% 0.21/0.54 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 3
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 3
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 3
% 0.21/0.54 # Processed clauses : 196
% 0.21/0.54 # ...of these trivial : 23
% 0.21/0.54 # ...subsumed : 30
% 0.21/0.54 # ...remaining for further processing : 143
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 9
% 0.21/0.54 # Backward-rewritten : 66
% 0.21/0.54 # Generated clauses : 1710
% 0.21/0.54 # ...of the previous two non-redundant : 1367
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 1710
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Total rewrite steps : 443
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 65
% 0.21/0.54 # Positive orientable unit clauses : 46
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 1
% 0.21/0.54 # Non-unit-clauses : 18
% 0.21/0.54 # Current number of unprocessed clauses: 519
% 0.21/0.54 # ...number of literals in the above : 723
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 78
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 424
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 424
% 0.21/0.54 # Non-unit clause-clause subsumptions : 39
% 0.21/0.54 # Unit Clause-clause subsumption calls : 144
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 3393
% 0.21/0.54 # BW rewrite match successes : 66
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 28459
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.031 s
% 0.21/0.54 # System time : 0.004 s
% 0.21/0.54 # Total time : 0.035 s
% 0.21/0.54 # Maximum resident set size: 1580 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.133 s
% 0.21/0.54 # System time : 0.011 s
% 0.21/0.54 # Total time : 0.143 s
% 0.21/0.54 # Maximum resident set size: 1676 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------