TSTP Solution File: LCL398-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL398-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:37 EDT 2023
% Result : Unsatisfiable 0.24s 0.54s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 8 RR)
% Number of literals : 26 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 27 ( 3 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.jm5jwJk2l3/E---3.1_28281.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.jm5jwJk2l3/E---3.1_28281.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.jm5jwJk2l3/E---3.1_28281.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.jm5jwJk2l3/E---3.1_28281.p',cn_2) ).
cnf(prove_cn_64,negated_conjecture,
~ is_a_theorem(implies(not(implies(x,x)),y)),
file('/export/starexec/sandbox2/tmp/tmp.jm5jwJk2l3/E---3.1_28281.p',prove_cn_64) ).
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,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_9,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_10,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_11,negated_conjecture,
~ is_a_theorem(implies(not(implies(x,x)),y)),
prove_cn_64 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(implies(x,x)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL398-1 : TPTP v8.1.2. Released v2.3.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n029.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 12:20:36 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.jm5jwJk2l3/E---3.1_28281.p
% 0.24/0.54 # Version: 3.1pre001
% 0.24/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 # Starting sh5l with 300s (1) cores
% 0.24/0.54 # new_bool_1 with pid 28361 completed with status 0
% 0.24/0.54 # Result found by new_bool_1
% 0.24/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.24/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 0.24/0.54 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 28363 completed with status 0
% 0.24/0.54 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.24/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54 # Search class: FHUNS-FFSF21-MFFFFFNN
% 0.24/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 0.24/0.54 # Preprocessing time : 0.001 s
% 0.24/0.54 # Presaturation interreduction done
% 0.24/0.54
% 0.24/0.54 # Proof found!
% 0.24/0.54 # SZS status Unsatisfiable
% 0.24/0.54 # SZS output start CNFRefutation
% See solution above
% 0.24/0.54 # Parsed axioms : 5
% 0.24/0.54 # Removed by relevancy pruning/SinE : 0
% 0.24/0.54 # Initial clauses : 5
% 0.24/0.54 # Removed in clause preprocessing : 0
% 0.24/0.54 # Initial clauses in saturation : 5
% 0.24/0.54 # Processed clauses : 28
% 0.24/0.54 # ...of these trivial : 0
% 0.24/0.54 # ...subsumed : 4
% 0.24/0.54 # ...remaining for further processing : 24
% 0.24/0.54 # Other redundant clauses eliminated : 0
% 0.24/0.54 # Clauses deleted for lack of memory : 0
% 0.24/0.54 # Backward-subsumed : 0
% 0.24/0.54 # Backward-rewritten : 1
% 0.24/0.54 # Generated clauses : 45
% 0.24/0.54 # ...of the previous two non-redundant : 38
% 0.24/0.54 # ...aggressively subsumed : 0
% 0.24/0.54 # Contextual simplify-reflections : 0
% 0.24/0.54 # Paramodulations : 45
% 0.24/0.54 # Factorizations : 0
% 0.24/0.54 # NegExts : 0
% 0.24/0.54 # Equation resolutions : 0
% 0.24/0.54 # Total rewrite steps : 1
% 0.24/0.54 # Propositional unsat checks : 0
% 0.24/0.54 # Propositional check models : 0
% 0.24/0.54 # Propositional check unsatisfiable : 0
% 0.24/0.54 # Propositional clauses : 0
% 0.24/0.54 # Propositional clauses after purity: 0
% 0.24/0.54 # Propositional unsat core size : 0
% 0.24/0.54 # Propositional preprocessing time : 0.000
% 0.24/0.54 # Propositional encoding time : 0.000
% 0.24/0.54 # Propositional solver time : 0.000
% 0.24/0.54 # Success case prop preproc time : 0.000
% 0.24/0.54 # Success case prop encoding time : 0.000
% 0.24/0.54 # Success case prop solver time : 0.000
% 0.24/0.54 # Current number of processed clauses : 18
% 0.24/0.54 # Positive orientable unit clauses : 4
% 0.24/0.54 # Positive unorientable unit clauses: 0
% 0.24/0.54 # Negative unit clauses : 1
% 0.24/0.54 # Non-unit-clauses : 13
% 0.24/0.54 # Current number of unprocessed clauses: 20
% 0.24/0.54 # ...number of literals in the above : 50
% 0.24/0.54 # Current number of archived formulas : 0
% 0.24/0.54 # Current number of archived clauses : 6
% 0.24/0.54 # Clause-clause subsumption calls (NU) : 25
% 0.24/0.54 # Rec. Clause-clause subsumption calls : 25
% 0.24/0.54 # Non-unit clause-clause subsumptions : 4
% 0.24/0.54 # Unit Clause-clause subsumption calls : 10
% 0.24/0.54 # Rewrite failures with RHS unbound : 0
% 0.24/0.54 # BW rewrite match attempts : 19
% 0.24/0.54 # BW rewrite match successes : 1
% 0.24/0.54 # Condensation attempts : 0
% 0.24/0.54 # Condensation successes : 0
% 0.24/0.54 # Termbank termtop insertions : 753
% 0.24/0.54
% 0.24/0.54 # -------------------------------------------------
% 0.24/0.54 # User time : 0.002 s
% 0.24/0.54 # System time : 0.002 s
% 0.24/0.54 # Total time : 0.004 s
% 0.24/0.54 # Maximum resident set size: 1648 pages
% 0.24/0.54
% 0.24/0.54 # -------------------------------------------------
% 0.24/0.54 # User time : 0.004 s
% 0.24/0.54 # System time : 0.002 s
% 0.24/0.54 # Total time : 0.007 s
% 0.24/0.54 # Maximum resident set size: 1676 pages
% 0.24/0.54 % E---3.1 exiting
% 0.42/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------