TSTP Solution File: SWC095-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC095-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:27:35 EDT 2024
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 16 unt; 0 nHn; 20 RR)
% Number of literals : 36 ( 17 equ; 20 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk1
| app(X1,X3) != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
app(app(sk5,sk6),sk7) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_12,negated_conjecture,
app(sk5,sk7) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(c_0_8,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk1
| app(X1,X3) != sk2 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_9,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk1
| app(X1,X3) != sk2 ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_11,negated_conjecture,
app(app(sk5,sk6),sk7) = sk3,
co1_11 ).
cnf(c_0_12,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_13,negated_conjecture,
( app(app(X1,X2),X3) != sk1
| app(X1,X3) != sk4
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
app(app(sk5,sk6),sk7) = sk1,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
app(sk5,sk7) = sk4,
co1_12 ).
cnf(c_0_16,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_17,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_18,negated_conjecture,
ssList(sk5),
co1_8 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : SWC095-1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.09 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n024.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 02:53:07 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.44 # Version: 3.1.0
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_3 with pid 9529 completed with status 0
% 0.15/0.44 # Result found by new_bool_3
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # SAT001_MinMin_p005000_rr_RG with pid 9532 completed with status 0
% 0.15/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.44 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.002 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Unsatisfiable
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 197
% 0.15/0.44 # Removed by relevancy pruning/SinE : 168
% 0.15/0.44 # Initial clauses : 29
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 29
% 0.15/0.44 # Processed clauses : 53
% 0.15/0.44 # ...of these trivial : 2
% 0.15/0.44 # ...subsumed : 0
% 0.15/0.44 # ...remaining for further processing : 51
% 0.15/0.44 # Other redundant clauses eliminated : 2
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 1
% 0.15/0.44 # Backward-rewritten : 0
% 0.15/0.44 # Generated clauses : 26
% 0.15/0.44 # ...of the previous two non-redundant : 16
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 25
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 2
% 0.15/0.44 # Disequality decompositions : 0
% 0.15/0.44 # Total rewrite steps : 39
% 0.15/0.44 # ...of those cached : 30
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 22
% 0.15/0.44 # Positive orientable unit clauses : 11
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 0
% 0.15/0.44 # Non-unit-clauses : 11
% 0.15/0.44 # Current number of unprocessed clauses: 13
% 0.15/0.44 # ...number of literals in the above : 46
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 28
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 68
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 31
% 0.15/0.44 # Non-unit clause-clause subsumptions : 1
% 0.15/0.44 # Unit Clause-clause subsumption calls : 0
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 0
% 0.15/0.44 # BW rewrite match successes : 0
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 2994
% 0.15/0.44 # Search garbage collected termcells : 928
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.004 s
% 0.15/0.44 # System time : 0.004 s
% 0.15/0.44 # Total time : 0.008 s
% 0.15/0.44 # Maximum resident set size: 1940 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.008 s
% 0.15/0.44 # System time : 0.006 s
% 0.15/0.44 # Total time : 0.014 s
% 0.15/0.44 # Maximum resident set size: 1872 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------