TSTP Solution File: LCL069-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL069-1 : TPTP v8.1.2. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:25 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 16 unt; 0 nHn; 16 RR)
% Number of literals : 53 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 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 : 72 ( 18 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.TlPtvKoN5l/E---3.1_21812.p',condensed_detachment) ).
cnf(cn_59,axiom,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
file('/export/starexec/sandbox2/tmp/tmp.TlPtvKoN5l/E---3.1_21812.p',cn_59) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox2/tmp/tmp.TlPtvKoN5l/E---3.1_21812.p',cn_37) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox2/tmp/tmp.TlPtvKoN5l/E---3.1_21812.p',cn_19) ).
cnf(prove_cn_3,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/tmp/tmp.TlPtvKoN5l/E---3.1_21812.p',prove_cn_3) ).
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(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
cn_59 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(implies(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(not(X1),X3))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_12,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X2),X1))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
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(implies(X3,X1),X4))
| ~ is_a_theorem(implies(X4,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,implies(X1,X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(X1,X1),X1))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_22]),c_0_16])]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(implies(X1,X2)),X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(not(X1),X3))),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
prove_cn_3 ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL069-1 : TPTP v8.1.2. Bugfixed v1.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.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:22:59 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.TlPtvKoN5l/E---3.1_21812.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 21892 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: FHUNS-FFSF21-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V 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 H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.21/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54 # H----_011_C07_F1_PI_SE_SP_S0V with pid 21900 completed with status 0
% 0.21/0.54 # Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 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: FHUNS-FFSF21-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V 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 H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.21/0.54 # Preprocessing time : 0.002 s
% 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 : 5
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 5
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 5
% 0.21/0.54 # Processed clauses : 625
% 0.21/0.54 # ...of these trivial : 5
% 0.21/0.54 # ...subsumed : 402
% 0.21/0.54 # ...remaining for further processing : 218
% 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 : 25
% 0.21/0.54 # Backward-rewritten : 1
% 0.21/0.54 # Generated clauses : 2468
% 0.21/0.54 # ...of the previous two non-redundant : 2372
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 2468
% 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 : 56
% 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 : 192
% 0.21/0.54 # Positive orientable unit clauses : 23
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 10
% 0.21/0.54 # Non-unit-clauses : 159
% 0.21/0.54 # Current number of unprocessed clauses: 1748
% 0.21/0.54 # ...number of literals in the above : 5337
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 26
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 5711
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 5355
% 0.21/0.54 # Non-unit clause-clause subsumptions : 416
% 0.21/0.54 # Unit Clause-clause subsumption calls : 200
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 284
% 0.21/0.54 # BW rewrite match successes : 1
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 36589
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.042 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.048 s
% 0.21/0.54 # Maximum resident set size: 1596 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.227 s
% 0.21/0.54 # System time : 0.015 s
% 0.21/0.54 # Total time : 0.242 s
% 0.21/0.54 # Maximum resident set size: 1676 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------