TSTP Solution File: LCL065-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL065-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:37 EDT 2023
% Result : Unsatisfiable 3.72s 0.96s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of clauses : 43 ( 16 unt; 0 nHn; 20 RR)
% Number of literals : 76 ( 0 equ; 35 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 88 ( 16 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.abOGVD5KXG/E---3.1_16633.p',condensed_detachment) ).
cnf(cn_35,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.abOGVD5KXG/E---3.1_16633.p',cn_35) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.abOGVD5KXG/E---3.1_16633.p',cn_18) ).
cnf(cn_49,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.abOGVD5KXG/E---3.1_16633.p',cn_49) ).
cnf(prove_cn_2,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox/tmp/tmp.abOGVD5KXG/E---3.1_16633.p',prove_cn_2) ).
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,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
cn_49 ).
cnf(c_0_14,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),X1))
| ~ is_a_theorem(implies(implies(not(X1),not(X2)),X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(not(not(X1)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),not(X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X2),X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_28]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_29]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_36,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(not(X1),implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_40,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
prove_cn_2 ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
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.05/0.10 % Problem : LCL065-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n015.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 12:54:46 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.abOGVD5KXG/E---3.1_16633.p
% 3.72/0.96 # Version: 3.1pre001
% 3.72/0.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.72/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/0.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.72/0.96 # Starting new_bool_3 with 300s (1) cores
% 3.72/0.96 # Starting new_bool_1 with 300s (1) cores
% 3.72/0.96 # Starting sh5l with 300s (1) cores
% 3.72/0.96 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 16718 completed with status 0
% 3.72/0.96 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.72/0.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.72/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/0.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.72/0.96 # No SInE strategy applied
% 3.72/0.96 # Search class: FHUNS-FFSF21-MFFFFFNN
% 3.72/0.96 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.72/0.96 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 3.72/0.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.72/0.96 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 3.72/0.96 # Starting new_bool_3 with 136s (1) cores
% 3.72/0.96 # Starting new_bool_1 with 136s (1) cores
% 3.72/0.96 # H----_011_C07_F1_PI_SE_SP_S0V with pid 16726 completed with status 0
% 3.72/0.96 # Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 3.72/0.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.72/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/0.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.72/0.96 # No SInE strategy applied
% 3.72/0.96 # Search class: FHUNS-FFSF21-MFFFFFNN
% 3.72/0.96 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.72/0.96 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 3.72/0.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.72/0.96 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 3.72/0.96 # Preprocessing time : 0.001 s
% 3.72/0.96
% 3.72/0.96 # Proof found!
% 3.72/0.96 # SZS status Unsatisfiable
% 3.72/0.96 # SZS output start CNFRefutation
% See solution above
% 3.72/0.96 # Parsed axioms : 5
% 3.72/0.96 # Removed by relevancy pruning/SinE : 0
% 3.72/0.96 # Initial clauses : 5
% 3.72/0.96 # Removed in clause preprocessing : 0
% 3.72/0.96 # Initial clauses in saturation : 5
% 3.72/0.96 # Processed clauses : 4175
% 3.72/0.96 # ...of these trivial : 195
% 3.72/0.96 # ...subsumed : 3131
% 3.72/0.96 # ...remaining for further processing : 849
% 3.72/0.96 # Other redundant clauses eliminated : 0
% 3.72/0.96 # Clauses deleted for lack of memory : 0
% 3.72/0.96 # Backward-subsumed : 10
% 3.72/0.96 # Backward-rewritten : 1
% 3.72/0.96 # Generated clauses : 42303
% 3.72/0.96 # ...of the previous two non-redundant : 36832
% 3.72/0.96 # ...aggressively subsumed : 0
% 3.72/0.96 # Contextual simplify-reflections : 0
% 3.72/0.96 # Paramodulations : 42303
% 3.72/0.96 # Factorizations : 0
% 3.72/0.96 # NegExts : 0
% 3.72/0.96 # Equation resolutions : 0
% 3.72/0.96 # Total rewrite steps : 6689
% 3.72/0.96 # Propositional unsat checks : 0
% 3.72/0.96 # Propositional check models : 0
% 3.72/0.96 # Propositional check unsatisfiable : 0
% 3.72/0.96 # Propositional clauses : 0
% 3.72/0.96 # Propositional clauses after purity: 0
% 3.72/0.96 # Propositional unsat core size : 0
% 3.72/0.96 # Propositional preprocessing time : 0.000
% 3.72/0.96 # Propositional encoding time : 0.000
% 3.72/0.96 # Propositional solver time : 0.000
% 3.72/0.96 # Success case prop preproc time : 0.000
% 3.72/0.96 # Success case prop encoding time : 0.000
% 3.72/0.96 # Success case prop solver time : 0.000
% 3.72/0.96 # Current number of processed clauses : 838
% 3.72/0.96 # Positive orientable unit clauses : 420
% 3.72/0.96 # Positive unorientable unit clauses: 0
% 3.72/0.96 # Negative unit clauses : 11
% 3.72/0.96 # Non-unit-clauses : 407
% 3.72/0.96 # Current number of unprocessed clauses: 32608
% 3.72/0.96 # ...number of literals in the above : 94457
% 3.72/0.96 # Current number of archived formulas : 0
% 3.72/0.96 # Current number of archived clauses : 11
% 3.72/0.96 # Clause-clause subsumption calls (NU) : 41803
% 3.72/0.96 # Rec. Clause-clause subsumption calls : 40392
% 3.72/0.96 # Non-unit clause-clause subsumptions : 3098
% 3.72/0.96 # Unit Clause-clause subsumption calls : 765
% 3.72/0.96 # Rewrite failures with RHS unbound : 0
% 3.72/0.96 # BW rewrite match attempts : 31638
% 3.72/0.96 # BW rewrite match successes : 3
% 3.72/0.96 # Condensation attempts : 0
% 3.72/0.96 # Condensation successes : 0
% 3.72/0.96 # Termbank termtop insertions : 645030
% 3.72/0.96
% 3.72/0.96 # -------------------------------------------------
% 3.72/0.96 # User time : 0.503 s
% 3.72/0.96 # System time : 0.017 s
% 3.72/0.96 # Total time : 0.520 s
% 3.72/0.96 # Maximum resident set size: 1596 pages
% 3.72/0.96
% 3.72/0.96 # -------------------------------------------------
% 3.72/0.96 # User time : 2.375 s
% 3.72/0.96 # System time : 0.051 s
% 3.72/0.96 # Total time : 2.426 s
% 3.72/0.96 # Maximum resident set size: 1676 pages
% 3.72/0.96 % E---3.1 exiting
%------------------------------------------------------------------------------