TSTP Solution File: SWC371-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC371-1 : TPTP v8.2.0. Released v2.4.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 : Tue May 21 04:29:19 EDT 2024
% Result : Unsatisfiable 1.00s 0.58s
% Output : CNFRefutation 1.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 19 unt; 0 nHn; 30 RR)
% Number of literals : 57 ( 9 equ; 32 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_11,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_10,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_11,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_12,negated_conjecture,
~ segmentP(sk2,sk1),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_13,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_10 ).
cnf(c_0_14,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_11 ).
cnf(c_0_15,axiom,
ssList(nil),
clause8 ).
cnf(c_0_16,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_17,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_18,negated_conjecture,
~ segmentP(sk2,sk1),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_22,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_23,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_27,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23])]) ).
cnf(c_0_28,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC371-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:32:23 EDT 2024
% 0.20/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.00/0.58 # Version: 3.1.0
% 1.00/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.00/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.00/0.58 # Starting new_bool_3 with 300s (1) cores
% 1.00/0.58 # Starting new_bool_1 with 300s (1) cores
% 1.00/0.58 # Starting sh5l with 300s (1) cores
% 1.00/0.58 # new_bool_3 with pid 27619 completed with status 0
% 1.00/0.58 # Result found by new_bool_3
% 1.00/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.00/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.00/0.58 # Starting new_bool_3 with 300s (1) cores
% 1.00/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.00/0.58 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.00/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.00/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.00/0.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27622 completed with status 0
% 1.00/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.00/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.00/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.00/0.58 # Starting new_bool_3 with 300s (1) cores
% 1.00/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.00/0.58 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.00/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.00/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.00/0.58 # Preprocessing time : 0.003 s
% 1.00/0.58 # Presaturation interreduction done
% 1.00/0.58
% 1.00/0.58 # Proof found!
% 1.00/0.58 # SZS status Unsatisfiable
% 1.00/0.58 # SZS output start CNFRefutation
% See solution above
% 1.00/0.58 # Parsed axioms : 197
% 1.00/0.58 # Removed by relevancy pruning/SinE : 131
% 1.00/0.58 # Initial clauses : 66
% 1.00/0.58 # Removed in clause preprocessing : 0
% 1.00/0.58 # Initial clauses in saturation : 66
% 1.00/0.58 # Processed clauses : 848
% 1.00/0.58 # ...of these trivial : 25
% 1.00/0.58 # ...subsumed : 403
% 1.00/0.58 # ...remaining for further processing : 420
% 1.00/0.58 # Other redundant clauses eliminated : 19
% 1.00/0.58 # Clauses deleted for lack of memory : 0
% 1.00/0.58 # Backward-subsumed : 43
% 1.00/0.58 # Backward-rewritten : 8
% 1.00/0.58 # Generated clauses : 2942
% 1.00/0.58 # ...of the previous two non-redundant : 2626
% 1.00/0.58 # ...aggressively subsumed : 0
% 1.00/0.58 # Contextual simplify-reflections : 41
% 1.00/0.58 # Paramodulations : 2908
% 1.00/0.58 # Factorizations : 0
% 1.00/0.58 # NegExts : 0
% 1.00/0.58 # Equation resolutions : 27
% 1.00/0.58 # Disequality decompositions : 0
% 1.00/0.58 # Total rewrite steps : 2620
% 1.00/0.58 # ...of those cached : 2596
% 1.00/0.58 # Propositional unsat checks : 0
% 1.00/0.58 # Propositional check models : 0
% 1.00/0.58 # Propositional check unsatisfiable : 0
% 1.00/0.58 # Propositional clauses : 0
% 1.00/0.58 # Propositional clauses after purity: 0
% 1.00/0.58 # Propositional unsat core size : 0
% 1.00/0.58 # Propositional preprocessing time : 0.000
% 1.00/0.58 # Propositional encoding time : 0.000
% 1.00/0.58 # Propositional solver time : 0.000
% 1.00/0.58 # Success case prop preproc time : 0.000
% 1.00/0.58 # Success case prop encoding time : 0.000
% 1.00/0.58 # Success case prop solver time : 0.000
% 1.00/0.58 # Current number of processed clauses : 294
% 1.00/0.58 # Positive orientable unit clauses : 26
% 1.00/0.58 # Positive unorientable unit clauses: 0
% 1.00/0.58 # Negative unit clauses : 10
% 1.00/0.58 # Non-unit-clauses : 258
% 1.00/0.58 # Current number of unprocessed clauses: 1867
% 1.00/0.58 # ...number of literals in the above : 10520
% 1.00/0.58 # Current number of archived formulas : 0
% 1.00/0.58 # Current number of archived clauses : 118
% 1.00/0.58 # Clause-clause subsumption calls (NU) : 10155
% 1.00/0.58 # Rec. Clause-clause subsumption calls : 3188
% 1.00/0.58 # Non-unit clause-clause subsumptions : 389
% 1.00/0.58 # Unit Clause-clause subsumption calls : 447
% 1.00/0.58 # Rewrite failures with RHS unbound : 0
% 1.00/0.58 # BW rewrite match attempts : 4
% 1.00/0.58 # BW rewrite match successes : 4
% 1.00/0.58 # Condensation attempts : 0
% 1.00/0.58 # Condensation successes : 0
% 1.00/0.58 # Termbank termtop insertions : 54932
% 1.00/0.58 # Search garbage collected termcells : 860
% 1.00/0.58
% 1.00/0.58 # -------------------------------------------------
% 1.00/0.58 # User time : 0.084 s
% 1.00/0.58 # System time : 0.005 s
% 1.00/0.58 # Total time : 0.089 s
% 1.00/0.58 # Maximum resident set size: 2080 pages
% 1.00/0.58
% 1.00/0.58 # -------------------------------------------------
% 1.00/0.58 # User time : 0.088 s
% 1.00/0.58 # System time : 0.007 s
% 1.00/0.58 # Total time : 0.095 s
% 1.00/0.58 # Maximum resident set size: 1876 pages
% 1.00/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------