TSTP Solution File: SWC370-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC370-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:40:40 EDT 2023
% Result : Unsatisfiable 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 17 unt; 0 nHn; 25 RR)
% Number of literals : 47 ( 10 equ; 25 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',co1_6) ).
cnf(co1_11,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',co1_5) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p',co1_7) ).
cnf(c_0_10,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_11,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_12,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_13,axiom,
ssList(nil),
clause8 ).
cnf(c_0_14,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_15,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
~ segmentP(sk2,sk1),
co1_11 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_21,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_22,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC370-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:03:00 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/tmp/tmp.l2ZdSQ4h6i/E---3.1_10927.p
% 0.21/0.60 # Version: 3.1pre001
% 0.21/0.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.60 # Starting sh5l with 300s (1) cores
% 0.21/0.60 # new_bool_3 with pid 11008 completed with status 0
% 0.21/0.60 # Result found by new_bool_3
% 0.21/0.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.60 # Search class: FHHSF-FFMM22-MFFFFFNN
% 0.21/0.60 # partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.21/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.60 # SAT001_MinMin_p005000_rr_RG with pid 11011 completed with status 0
% 0.21/0.60 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.60 # Search class: FHHSF-FFMM22-MFFFFFNN
% 0.21/0.60 # partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.21/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.60 # Preprocessing time : 0.003 s
% 0.21/0.60 # Presaturation interreduction done
% 0.21/0.60
% 0.21/0.60 # Proof found!
% 0.21/0.60 # SZS status Unsatisfiable
% 0.21/0.60 # SZS output start CNFRefutation
% See solution above
% 0.21/0.60 # Parsed axioms : 197
% 0.21/0.60 # Removed by relevancy pruning/SinE : 157
% 0.21/0.60 # Initial clauses : 40
% 0.21/0.60 # Removed in clause preprocessing : 0
% 0.21/0.60 # Initial clauses in saturation : 40
% 0.21/0.60 # Processed clauses : 831
% 0.21/0.60 # ...of these trivial : 22
% 0.21/0.60 # ...subsumed : 481
% 0.21/0.60 # ...remaining for further processing : 328
% 0.21/0.60 # Other redundant clauses eliminated : 13
% 0.21/0.60 # Clauses deleted for lack of memory : 0
% 0.21/0.60 # Backward-subsumed : 42
% 0.21/0.60 # Backward-rewritten : 18
% 0.21/0.60 # Generated clauses : 2801
% 0.21/0.60 # ...of the previous two non-redundant : 2486
% 0.21/0.60 # ...aggressively subsumed : 0
% 0.21/0.60 # Contextual simplify-reflections : 51
% 0.21/0.60 # Paramodulations : 2787
% 0.21/0.60 # Factorizations : 0
% 0.21/0.60 # NegExts : 0
% 0.21/0.60 # Equation resolutions : 15
% 0.21/0.60 # Total rewrite steps : 2778
% 0.21/0.60 # Propositional unsat checks : 0
% 0.21/0.60 # Propositional check models : 0
% 0.21/0.60 # Propositional check unsatisfiable : 0
% 0.21/0.60 # Propositional clauses : 0
% 0.21/0.60 # Propositional clauses after purity: 0
% 0.21/0.60 # Propositional unsat core size : 0
% 0.21/0.60 # Propositional preprocessing time : 0.000
% 0.21/0.60 # Propositional encoding time : 0.000
% 0.21/0.60 # Propositional solver time : 0.000
% 0.21/0.60 # Success case prop preproc time : 0.000
% 0.21/0.60 # Success case prop encoding time : 0.000
% 0.21/0.60 # Success case prop solver time : 0.000
% 0.21/0.60 # Current number of processed clauses : 226
% 0.21/0.60 # Positive orientable unit clauses : 17
% 0.21/0.60 # Positive unorientable unit clauses: 0
% 0.21/0.60 # Negative unit clauses : 12
% 0.21/0.60 # Non-unit-clauses : 197
% 0.21/0.60 # Current number of unprocessed clauses: 1670
% 0.21/0.60 # ...number of literals in the above : 9542
% 0.21/0.60 # Current number of archived formulas : 0
% 0.21/0.60 # Current number of archived clauses : 98
% 0.21/0.60 # Clause-clause subsumption calls (NU) : 11980
% 0.21/0.60 # Rec. Clause-clause subsumption calls : 3162
% 0.21/0.60 # Non-unit clause-clause subsumptions : 458
% 0.21/0.60 # Unit Clause-clause subsumption calls : 783
% 0.21/0.60 # Rewrite failures with RHS unbound : 0
% 0.21/0.60 # BW rewrite match attempts : 5
% 0.21/0.60 # BW rewrite match successes : 5
% 0.21/0.60 # Condensation attempts : 0
% 0.21/0.60 # Condensation successes : 0
% 0.21/0.60 # Termbank termtop insertions : 49874
% 0.21/0.60
% 0.21/0.60 # -------------------------------------------------
% 0.21/0.60 # User time : 0.070 s
% 0.21/0.60 # System time : 0.007 s
% 0.21/0.60 # Total time : 0.077 s
% 0.21/0.60 # Maximum resident set size: 2016 pages
% 0.21/0.60
% 0.21/0.60 # -------------------------------------------------
% 0.21/0.60 # User time : 0.072 s
% 0.21/0.60 # System time : 0.011 s
% 0.21/0.60 # Total time : 0.083 s
% 0.21/0.60 # Maximum resident set size: 1852 pages
% 0.21/0.60 % E---3.1 exiting
% 0.21/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------