TSTP Solution File: SWC040-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC040-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Tue May 21 04:22:45 EDT 2024
% Result : Unsatisfiable 0.10s 0.36s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 12 unt; 0 nHn; 15 RR)
% Number of literals : 18 ( 17 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
nil = sk2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_5,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_6,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_7,negated_conjecture,
sk2 = sk4,
co1_6 ).
cnf(c_0_8,negated_conjecture,
nil = sk2,
co1_5 ).
cnf(c_0_9,negated_conjecture,
nil != sk1,
c_0_5 ).
cnf(c_0_10,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_11,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_6 ).
cnf(c_0_12,negated_conjecture,
sk4 = nil,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
sk3 != nil,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC040-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n007.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sun May 19 03:11:07 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.10/0.35 Running first-order theorem proving
% 0.10/0.35 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.10/0.36 # Version: 3.1.0
% 0.10/0.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.36 # Starting sh5l with 300s (1) cores
% 0.10/0.36 # new_bool_3 with pid 24917 completed with status 0
% 0.10/0.36 # Result found by new_bool_3
% 0.10/0.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.36 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.10/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.36 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.10/0.36 # SAT001_MinMin_p005000_rr_RG with pid 24921 completed with status 0
% 0.10/0.36 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.10/0.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.36 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.10/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.36 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.10/0.36 # Preprocessing time : 0.002 s
% 0.10/0.36 # Presaturation interreduction done
% 0.10/0.36
% 0.10/0.36 # Proof found!
% 0.10/0.36 # SZS status Unsatisfiable
% 0.10/0.36 # SZS output start CNFRefutation
% See solution above
% 0.10/0.36 # Parsed axioms : 198
% 0.10/0.36 # Removed by relevancy pruning/SinE : 164
% 0.10/0.36 # Initial clauses : 34
% 0.10/0.36 # Removed in clause preprocessing : 0
% 0.10/0.36 # Initial clauses in saturation : 34
% 0.10/0.36 # Processed clauses : 6
% 0.10/0.36 # ...of these trivial : 0
% 0.10/0.36 # ...subsumed : 0
% 0.10/0.36 # ...remaining for further processing : 5
% 0.10/0.36 # Other redundant clauses eliminated : 0
% 0.10/0.36 # Clauses deleted for lack of memory : 0
% 0.10/0.36 # Backward-subsumed : 0
% 0.10/0.36 # Backward-rewritten : 1
% 0.10/0.36 # Generated clauses : 0
% 0.10/0.36 # ...of the previous two non-redundant : 1
% 0.10/0.36 # ...aggressively subsumed : 0
% 0.10/0.36 # Contextual simplify-reflections : 0
% 0.10/0.36 # Paramodulations : 0
% 0.10/0.36 # Factorizations : 0
% 0.10/0.36 # NegExts : 0
% 0.10/0.36 # Equation resolutions : 0
% 0.10/0.36 # Disequality decompositions : 0
% 0.10/0.36 # Total rewrite steps : 3
% 0.10/0.36 # ...of those cached : 0
% 0.10/0.36 # Propositional unsat checks : 0
% 0.10/0.36 # Propositional check models : 0
% 0.10/0.36 # Propositional check unsatisfiable : 0
% 0.10/0.36 # Propositional clauses : 0
% 0.10/0.36 # Propositional clauses after purity: 0
% 0.10/0.36 # Propositional unsat core size : 0
% 0.10/0.36 # Propositional preprocessing time : 0.000
% 0.10/0.36 # Propositional encoding time : 0.000
% 0.10/0.36 # Propositional solver time : 0.000
% 0.10/0.36 # Success case prop preproc time : 0.000
% 0.10/0.36 # Success case prop encoding time : 0.000
% 0.10/0.36 # Success case prop solver time : 0.000
% 0.10/0.36 # Current number of processed clauses : 4
% 0.10/0.36 # Positive orientable unit clauses : 3
% 0.10/0.36 # Positive unorientable unit clauses: 0
% 0.10/0.36 # Negative unit clauses : 1
% 0.10/0.36 # Non-unit-clauses : 0
% 0.10/0.36 # Current number of unprocessed clauses: 29
% 0.10/0.36 # ...number of literals in the above : 91
% 0.10/0.36 # Current number of archived formulas : 0
% 0.10/0.36 # Current number of archived clauses : 1
% 0.10/0.36 # Clause-clause subsumption calls (NU) : 0
% 0.10/0.36 # Rec. Clause-clause subsumption calls : 0
% 0.10/0.36 # Non-unit clause-clause subsumptions : 0
% 0.10/0.36 # Unit Clause-clause subsumption calls : 0
% 0.10/0.36 # Rewrite failures with RHS unbound : 0
% 0.10/0.36 # BW rewrite match attempts : 1
% 0.10/0.36 # BW rewrite match successes : 1
% 0.10/0.36 # Condensation attempts : 0
% 0.10/0.36 # Condensation successes : 0
% 0.10/0.36 # Termbank termtop insertions : 2513
% 0.10/0.36 # Search garbage collected termcells : 927
% 0.10/0.36
% 0.10/0.36 # -------------------------------------------------
% 0.10/0.36 # User time : 0.001 s
% 0.10/0.36 # System time : 0.003 s
% 0.10/0.36 # Total time : 0.004 s
% 0.10/0.36 # Maximum resident set size: 1932 pages
% 0.10/0.36
% 0.10/0.36 # -------------------------------------------------
% 0.10/0.36 # User time : 0.004 s
% 0.10/0.36 # System time : 0.003 s
% 0.10/0.36 # Total time : 0.007 s
% 0.10/0.36 # Maximum resident set size: 1876 pages
% 0.10/0.36 % E---3.1 exiting
% 0.10/0.36 % E exiting
%------------------------------------------------------------------------------