TSTP Solution File: LCL035-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL035-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Mon May 20 23:44:42 EDT 2024
% Result : Unsatisfiable 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 9 RR)
% Number of literals : 32 ( 0 equ; 14 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 32 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c0_CAMerideth,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_CAMerideth) ).
cnf(prove_c0_4,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_4) ).
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(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
c0_CAMerideth ).
cnf(c_0_6,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(implies(implies(implies(X2,X4),implies(X3,falsehood)),X5),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(X1,implies(falsehood,X2)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,implies(falsehood,X4)),X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(falsehood,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(X1,implies(X2,implies(falsehood,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(falsehood,X1))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(falsehood,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(falsehood,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,implies(falsehood,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
inference(fof_simplification,[status(thm)],[prove_c0_4]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(falsehood,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
c_0_16 ).
cnf(c_0_19,plain,
is_a_theorem(implies(falsehood,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL035-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 00:30:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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/benchmark/theBenchmark.p
% 0.17/0.44 # Version: 3.1.0
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # new_bool_3 with pid 19036 completed with status 0
% 0.17/0.44 # Result found by new_bool_3
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.17/0.44 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 19040 completed with status 0
% 0.17/0.44 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.17/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FHUNF-FFSF22-MFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Unsatisfiable
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 3
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 3
% 0.17/0.44 # Removed in clause preprocessing : 0
% 0.17/0.44 # Initial clauses in saturation : 3
% 0.17/0.44 # Processed clauses : 23
% 0.17/0.44 # ...of these trivial : 4
% 0.17/0.44 # ...subsumed : 0
% 0.17/0.44 # ...remaining for further processing : 19
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 2
% 0.17/0.44 # Backward-rewritten : 5
% 0.17/0.44 # Generated clauses : 49
% 0.17/0.44 # ...of the previous two non-redundant : 40
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 49
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Disequality decompositions : 0
% 0.17/0.44 # Total rewrite steps : 17
% 0.17/0.44 # ...of those cached : 4
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 12
% 0.17/0.44 # Positive orientable unit clauses : 7
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 1
% 0.17/0.44 # Non-unit-clauses : 4
% 0.17/0.44 # Current number of unprocessed clauses: 11
% 0.17/0.44 # ...number of literals in the above : 12
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 7
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 5
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 5
% 0.17/0.44 # Non-unit clause-clause subsumptions : 1
% 0.17/0.44 # Unit Clause-clause subsumption calls : 3
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 33
% 0.17/0.44 # BW rewrite match successes : 5
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 672
% 0.17/0.44 # Search garbage collected termcells : 8
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.002 s
% 0.17/0.44 # System time : 0.001 s
% 0.17/0.44 # Total time : 0.004 s
% 0.17/0.44 # Maximum resident set size: 1624 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.004 s
% 0.17/0.44 # System time : 0.002 s
% 0.17/0.44 # Total time : 0.006 s
% 0.17/0.44 # Maximum resident set size: 1692 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.44 % E exiting
%------------------------------------------------------------------------------