TSTP Solution File: LCL365-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL365-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:12:31 EDT 2023
% Result : Unsatisfiable 11.23s 2.19s
% Output : CNFRefutation 11.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 36 ( 17 unt; 0 nHn; 14 RR)
% Number of literals : 61 ( 0 equ; 29 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 83 ( 13 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.caGIVOAzVj/E---3.1_30901.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.caGIVOAzVj/E---3.1_30901.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.caGIVOAzVj/E---3.1_30901.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.caGIVOAzVj/E---3.1_30901.p',cn_3) ).
cnf(prove_cn_14,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
file('/export/starexec/sandbox2/tmp/tmp.caGIVOAzVj/E---3.1_30901.p',prove_cn_14) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
prove_cn_14 ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X2,implies(X5,X4)))
| ~ is_a_theorem(implies(X1,implies(X3,X5))) ),
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X3,X5),implies(X2,X5)),X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_6]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
~ is_a_theorem(implies(implies(not(z),y),implies(x,implies(implies(y,z),z)))),
inference(spm,[status(thm)],[c_0_24,c_0_7]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X1,implies(X3,X4))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X3),implies(implies(X3,X2),X2)))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL365-1 : TPTP v8.1.2. Released v2.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.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:25:55 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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/tmp/tmp.caGIVOAzVj/E---3.1_30901.p
% 11.23/2.19 # Version: 3.1pre001
% 11.23/2.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.23/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.23/2.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.23/2.19 # Starting new_bool_3 with 300s (1) cores
% 11.23/2.19 # Starting new_bool_1 with 300s (1) cores
% 11.23/2.19 # Starting sh5l with 300s (1) cores
% 11.23/2.19 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30999 completed with status 0
% 11.23/2.19 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 11.23/2.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.23/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.23/2.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.23/2.19 # No SInE strategy applied
% 11.23/2.19 # Search class: FHUNS-FFSF21-MFFFFFNN
% 11.23/2.19 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.23/2.19 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 11.23/2.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.23/2.19 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 11.23/2.19 # Starting new_bool_3 with 136s (1) cores
% 11.23/2.19 # Starting new_bool_1 with 136s (1) cores
% 11.23/2.19 # H----_011_C07_F1_PI_SE_SP_S0V with pid 31007 completed with status 0
% 11.23/2.19 # Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 11.23/2.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.23/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.23/2.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.23/2.19 # No SInE strategy applied
% 11.23/2.19 # Search class: FHUNS-FFSF21-MFFFFFNN
% 11.23/2.19 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.23/2.19 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 11.23/2.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.23/2.19 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 11.23/2.19 # Preprocessing time : 0.001 s
% 11.23/2.19
% 11.23/2.19 # Proof found!
% 11.23/2.19 # SZS status Unsatisfiable
% 11.23/2.19 # SZS output start CNFRefutation
% See solution above
% 11.23/2.19 # Parsed axioms : 5
% 11.23/2.19 # Removed by relevancy pruning/SinE : 0
% 11.23/2.19 # Initial clauses : 5
% 11.23/2.19 # Removed in clause preprocessing : 0
% 11.23/2.19 # Initial clauses in saturation : 5
% 11.23/2.19 # Processed clauses : 26137
% 11.23/2.19 # ...of these trivial : 240
% 11.23/2.19 # ...subsumed : 23816
% 11.23/2.19 # ...remaining for further processing : 2081
% 11.23/2.19 # Other redundant clauses eliminated : 0
% 11.23/2.19 # Clauses deleted for lack of memory : 0
% 11.23/2.19 # Backward-subsumed : 234
% 11.23/2.19 # Backward-rewritten : 6
% 11.23/2.19 # Generated clauses : 141146
% 11.23/2.19 # ...of the previous two non-redundant : 137081
% 11.23/2.19 # ...aggressively subsumed : 0
% 11.23/2.19 # Contextual simplify-reflections : 0
% 11.23/2.19 # Paramodulations : 141146
% 11.23/2.19 # Factorizations : 0
% 11.23/2.19 # NegExts : 0
% 11.23/2.19 # Equation resolutions : 0
% 11.23/2.19 # Total rewrite steps : 4482
% 11.23/2.19 # Propositional unsat checks : 0
% 11.23/2.19 # Propositional check models : 0
% 11.23/2.19 # Propositional check unsatisfiable : 0
% 11.23/2.19 # Propositional clauses : 0
% 11.23/2.19 # Propositional clauses after purity: 0
% 11.23/2.19 # Propositional unsat core size : 0
% 11.23/2.19 # Propositional preprocessing time : 0.000
% 11.23/2.19 # Propositional encoding time : 0.000
% 11.23/2.19 # Propositional solver time : 0.000
% 11.23/2.19 # Success case prop preproc time : 0.000
% 11.23/2.19 # Success case prop encoding time : 0.000
% 11.23/2.19 # Success case prop solver time : 0.000
% 11.23/2.19 # Current number of processed clauses : 1841
% 11.23/2.19 # Positive orientable unit clauses : 107
% 11.23/2.19 # Positive unorientable unit clauses: 0
% 11.23/2.19 # Negative unit clauses : 107
% 11.23/2.19 # Non-unit-clauses : 1627
% 11.23/2.19 # Current number of unprocessed clauses: 110703
% 11.23/2.19 # ...number of literals in the above : 397017
% 11.23/2.19 # Current number of archived formulas : 0
% 11.23/2.19 # Current number of archived clauses : 240
% 11.23/2.19 # Clause-clause subsumption calls (NU) : 469684
% 11.23/2.19 # Rec. Clause-clause subsumption calls : 324908
% 11.23/2.19 # Non-unit clause-clause subsumptions : 18800
% 11.23/2.19 # Unit Clause-clause subsumption calls : 12039
% 11.23/2.19 # Rewrite failures with RHS unbound : 0
% 11.23/2.19 # BW rewrite match attempts : 16721
% 11.23/2.19 # BW rewrite match successes : 7
% 11.23/2.19 # Condensation attempts : 0
% 11.23/2.19 # Condensation successes : 0
% 11.23/2.19 # Termbank termtop insertions : 2165633
% 11.23/2.19
% 11.23/2.19 # -------------------------------------------------
% 11.23/2.19 # User time : 1.387 s
% 11.23/2.19 # System time : 0.052 s
% 11.23/2.19 # Total time : 1.439 s
% 11.23/2.19 # Maximum resident set size: 1596 pages
% 11.23/2.19
% 11.23/2.19 # -------------------------------------------------
% 11.23/2.19 # User time : 6.442 s
% 11.23/2.19 # System time : 0.145 s
% 11.23/2.19 # Total time : 6.588 s
% 11.23/2.19 # Maximum resident set size: 1680 pages
% 11.23/2.19 % E---3.1 exiting
% 11.23/2.19 % E---3.1 exiting
%------------------------------------------------------------------------------