TSTP Solution File: LCL043-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL043-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:43 EDT 2024
% Result : Unsatisfiable 136.28s 136.51s
% Output : CNFRefutation 136.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 12 unt; 0 nHn; 9 RR)
% Number of literals : 25 ( 0 equ; 11 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 : 25 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(cn_54,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
cnf(prove_cn_39,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(c_0_5,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_6,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X2),X2))),
cn_54 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(not(X1),X2),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_10,plain,
is_a_theorem(implies(implies(not(X1),implies(X2,X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
inference(fof_simplification,[status(thm)],[prove_cn_39]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_14,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
c_0_11 ).
cnf(c_0_15,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
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.06/0.11 % Problem : LCL043-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.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 03:30:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 136.28/136.51 # Version: 3.1.0
% 136.28/136.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.28/136.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.28/136.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.28/136.51 # Starting new_bool_3 with 300s (1) cores
% 136.28/136.51 # Starting new_bool_1 with 300s (1) cores
% 136.28/136.51 # Starting sh5l with 300s (1) cores
% 136.28/136.51 # new_bool_3 with pid 16101 completed with status 0
% 136.28/136.51 # Result found by new_bool_3
% 136.28/136.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.28/136.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.28/136.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.28/136.51 # Starting new_bool_3 with 300s (1) cores
% 136.28/136.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 136.28/136.51 # Search class: FHUNM-FFSF21-MFFFFFNN
% 136.28/136.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.28/136.51 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 136.28/136.51 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 16105 completed with status 0
% 136.28/136.51 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 136.28/136.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 136.28/136.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.28/136.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 136.28/136.51 # Starting new_bool_3 with 300s (1) cores
% 136.28/136.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 136.28/136.51 # Search class: FHUNM-FFSF21-MFFFFFNN
% 136.28/136.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.28/136.51 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 136.28/136.51 # Preprocessing time : 0.001 s
% 136.28/136.51 # Presaturation interreduction done
% 136.28/136.51
% 136.28/136.51 # Proof found!
% 136.28/136.51 # SZS status Unsatisfiable
% 136.28/136.51 # SZS output start CNFRefutation
% See solution above
% 136.28/136.51 # Parsed axioms : 7
% 136.28/136.51 # Removed by relevancy pruning/SinE : 0
% 136.28/136.51 # Initial clauses : 7
% 136.28/136.51 # Removed in clause preprocessing : 0
% 136.28/136.51 # Initial clauses in saturation : 7
% 136.28/136.51 # Processed clauses : 150
% 136.28/136.51 # ...of these trivial : 2
% 136.28/136.51 # ...subsumed : 71
% 136.28/136.51 # ...remaining for further processing : 77
% 136.28/136.51 # Other redundant clauses eliminated : 0
% 136.28/136.51 # Clauses deleted for lack of memory : 0
% 136.28/136.51 # Backward-subsumed : 3
% 136.28/136.51 # Backward-rewritten : 1
% 136.28/136.51 # Generated clauses : 443
% 136.28/136.51 # ...of the previous two non-redundant : 331
% 136.28/136.51 # ...aggressively subsumed : 0
% 136.28/136.51 # Contextual simplify-reflections : 0
% 136.28/136.51 # Paramodulations : 443
% 136.28/136.51 # Factorizations : 0
% 136.28/136.51 # NegExts : 0
% 136.28/136.51 # Equation resolutions : 0
% 136.28/136.51 # Disequality decompositions : 0
% 136.28/136.51 # Total rewrite steps : 100
% 136.28/136.51 # ...of those cached : 63
% 136.28/136.51 # Propositional unsat checks : 0
% 136.28/136.51 # Propositional check models : 0
% 136.28/136.51 # Propositional check unsatisfiable : 0
% 136.28/136.51 # Propositional clauses : 0
% 136.28/136.51 # Propositional clauses after purity: 0
% 136.28/136.51 # Propositional unsat core size : 0
% 136.28/136.51 # Propositional preprocessing time : 0.000
% 136.28/136.51 # Propositional encoding time : 0.000
% 136.28/136.51 # Propositional solver time : 0.000
% 136.28/136.51 # Success case prop preproc time : 0.000
% 136.28/136.51 # Success case prop encoding time : 0.000
% 136.28/136.51 # Success case prop solver time : 0.000
% 136.28/136.51 # Current number of processed clauses : 66
% 136.28/136.51 # Positive orientable unit clauses : 35
% 136.28/136.51 # Positive unorientable unit clauses: 0
% 136.28/136.51 # Negative unit clauses : 2
% 136.28/136.51 # Non-unit-clauses : 29
% 136.28/136.51 # Current number of unprocessed clauses: 161
% 136.28/136.51 # ...number of literals in the above : 249
% 136.28/136.51 # Current number of archived formulas : 0
% 136.28/136.51 # Current number of archived clauses : 11
% 136.28/136.51 # Clause-clause subsumption calls (NU) : 334
% 136.28/136.51 # Rec. Clause-clause subsumption calls : 334
% 136.28/136.51 # Non-unit clause-clause subsumptions : 73
% 136.28/136.51 # Unit Clause-clause subsumption calls : 41
% 136.28/136.51 # Rewrite failures with RHS unbound : 0
% 136.28/136.51 # BW rewrite match attempts : 461
% 136.28/136.51 # BW rewrite match successes : 2
% 136.28/136.51 # Condensation attempts : 0
% 136.28/136.51 # Condensation successes : 0
% 136.28/136.51 # Termbank termtop insertions : 4942
% 136.28/136.51 # Search garbage collected termcells : 8
% 136.28/136.51
% 136.28/136.51 # -------------------------------------------------
% 136.28/136.51 # User time : 0.011 s
% 136.28/136.51 # System time : 0.000 s
% 136.28/136.51 # Total time : 0.011 s
% 136.28/136.51 # Maximum resident set size: 1632 pages
% 136.28/136.51
% 136.28/136.51 # -------------------------------------------------
% 136.28/136.51 # User time : 0.011 s
% 136.28/136.51 # System time : 0.002 s
% 136.28/136.51 # Total time : 0.014 s
% 136.28/136.51 # Maximum resident set size: 1696 pages
% 136.28/136.51 % E---3.1 exiting
% 136.28/136.52 % E exiting
%------------------------------------------------------------------------------