TSTP Solution File: LCL115-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL115-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:11:36 EDT 2023
% Result : Unsatisfiable 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of clauses : 37 ( 27 unt; 0 nHn; 12 RR)
% Number of literals : 49 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ELkkSKfzNa/E---3.1_6555.p',condensed_detachment) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.ELkkSKfzNa/E---3.1_6555.p',mv_2) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.ELkkSKfzNa/E---3.1_6555.p',mv_1) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox2/tmp/tmp.ELkkSKfzNa/E---3.1_6555.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.ELkkSKfzNa/E---3.1_6555.p',mv_5) ).
cnf(prove_mv_39,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
file('/export/starexec/sandbox2/tmp/tmp.ELkkSKfzNa/E---3.1_6555.p',prove_mv_39) ).
cnf(c_0_6,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv_2 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv_1 ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv_3 ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(X1,X3),X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_16,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
mv_5 ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(not(X2),not(X1)),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),not(X1)),X2))),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_22]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(not(X1),not(implies(X2,X2))),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(not(X1)),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_27]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(not(not(X1)),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(not(not(X1)),not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
prove_mv_39 ).
cnf(c_0_35,plain,
is_a_theorem(implies(not(implies(X1,X2)),not(X2))),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL115-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 11:44:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.ELkkSKfzNa/E---3.1_6555.p
% 0.21/0.55 # Version: 3.1pre001
% 0.21/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # new_bool_3 with pid 6638 completed with status 0
% 0.21/0.55 # Result found by new_bool_3
% 0.21/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.21/0.55 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 6643 completed with status 0
% 0.21/0.55 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.21/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.21/0.55 # Preprocessing time : 0.001 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Unsatisfiable
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 6
% 0.21/0.55 # Removed by relevancy pruning/SinE : 0
% 0.21/0.55 # Initial clauses : 6
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 6
% 0.21/0.55 # Processed clauses : 586
% 0.21/0.55 # ...of these trivial : 10
% 0.21/0.55 # ...subsumed : 360
% 0.21/0.55 # ...remaining for further processing : 216
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 4
% 0.21/0.55 # Backward-rewritten : 2
% 0.21/0.55 # Generated clauses : 2872
% 0.21/0.55 # ...of the previous two non-redundant : 2187
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 0
% 0.21/0.55 # Paramodulations : 2872
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Total rewrite steps : 646
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 204
% 0.21/0.55 # Positive orientable unit clauses : 101
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 3
% 0.21/0.55 # Non-unit-clauses : 100
% 0.21/0.55 # Current number of unprocessed clauses: 1602
% 0.21/0.55 # ...number of literals in the above : 2636
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 12
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 1880
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 1873
% 0.21/0.55 # Non-unit clause-clause subsumptions : 362
% 0.21/0.55 # Unit Clause-clause subsumption calls : 188
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 2405
% 0.21/0.55 # BW rewrite match successes : 3
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 30530
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.041 s
% 0.21/0.55 # System time : 0.003 s
% 0.21/0.55 # Total time : 0.044 s
% 0.21/0.55 # Maximum resident set size: 1648 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.042 s
% 0.21/0.55 # System time : 0.004 s
% 0.21/0.55 # Total time : 0.047 s
% 0.21/0.55 # Maximum resident set size: 1676 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------