TSTP Solution File: LCL359-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL359-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:18:39 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 30 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 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.qPyNXL3zSI/E---3.1_27708.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.qPyNXL3zSI/E---3.1_27708.p',cn_1) ).
cnf(prove_cn_08,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(implies(z,x),implies(implies(y,u),implies(z,u))))),
file('/export/starexec/sandbox2/tmp/tmp.qPyNXL3zSI/E---3.1_27708.p',prove_cn_08) ).
cnf(c_0_3,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_4,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_6,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,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_4,c_0_6]) ).
cnf(c_0_8,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_7,c_0_6]) ).
cnf(c_0_9,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_7,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(implies(z,x),implies(implies(y,u),implies(z,u))))),
inference(fof_simplification,[status(thm)],[prove_cn_08]) ).
cnf(c_0_11,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_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(implies(z,x),implies(implies(y,u),implies(z,u))))),
c_0_10 ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,implies(X2,X5)))))
| ~ is_a_theorem(implies(X1,implies(X4,implies(X3,X5)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL359-1 : TPTP v8.1.2. Released v2.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 08:49:18 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.49 Running first-order theorem proving
% 0.19/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.qPyNXL3zSI/E---3.1_27708.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_1 with pid 27846 completed with status 0
% 0.19/0.51 # Result found by new_bool_1
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 0.19/0.51 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 27848 completed with status 0
% 0.19/0.51 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.19/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 163s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 5
% 0.19/0.51 # Removed by relevancy pruning/SinE : 2
% 0.19/0.51 # Initial clauses : 3
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 3
% 0.19/0.51 # Processed clauses : 23
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 4
% 0.19/0.51 # ...remaining for further processing : 19
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 0
% 0.19/0.51 # Generated clauses : 78
% 0.19/0.51 # ...of the previous two non-redundant : 68
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 78
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 1
% 0.19/0.51 # ...of those cached : 0
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 19
% 0.19/0.51 # Positive orientable unit clauses : 1
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 17
% 0.19/0.51 # Current number of unprocessed clauses: 46
% 0.19/0.51 # ...number of literals in the above : 128
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 0
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 122
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 122
% 0.19/0.51 # Non-unit clause-clause subsumptions : 4
% 0.19/0.51 # Unit Clause-clause subsumption calls : 0
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 0
% 0.19/0.51 # BW rewrite match successes : 0
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 1587
% 0.19/0.51 # Search garbage collected termcells : 17
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.005 s
% 0.19/0.51 # System time : 0.002 s
% 0.19/0.51 # Total time : 0.008 s
% 0.19/0.51 # Maximum resident set size: 1612 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.007 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.012 s
% 0.19/0.51 # Maximum resident set size: 1696 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------