TSTP Solution File: SWC371-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC371-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 18 unt; 0 nHn; 26 RR)
% Number of literals : 46 ( 8 equ; 24 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 : 16 ( 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/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',clause172) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',co1_6) ).
cnf(co1_11,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',co1_5) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',co1_7) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p',clause57) ).
cnf(c_0_10,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_11,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_12,axiom,
ssList(nil),
clause8 ).
cnf(c_0_13,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,negated_conjecture,
~ segmentP(sk2,sk1),
co1_11 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,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_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_19,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_20,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_22,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_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20])]) ).
cnf(c_0_24,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : SWC371-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n009.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:53:14 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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/tmp/tmp.nKOXXvpQ4K/E---3.1_32031.p
% 0.16/0.50 # Version: 3.1pre001
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # new_bool_1 with pid 32111 completed with status 0
% 0.16/0.50 # Result found by new_bool_1
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32114 completed with status 0
% 0.16/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.50 # Preprocessing time : 0.002 s
% 0.16/0.50 # Presaturation interreduction done
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Unsatisfiable
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.50 # Parsed axioms : 197
% 0.16/0.50 # Removed by relevancy pruning/SinE : 131
% 0.16/0.50 # Initial clauses : 66
% 0.16/0.50 # Removed in clause preprocessing : 0
% 0.16/0.50 # Initial clauses in saturation : 66
% 0.16/0.50 # Processed clauses : 814
% 0.16/0.50 # ...of these trivial : 23
% 0.16/0.50 # ...subsumed : 392
% 0.16/0.50 # ...remaining for further processing : 399
% 0.16/0.50 # Other redundant clauses eliminated : 19
% 0.16/0.50 # Clauses deleted for lack of memory : 0
% 0.16/0.50 # Backward-subsumed : 44
% 0.16/0.50 # Backward-rewritten : 7
% 0.16/0.50 # Generated clauses : 2703
% 0.16/0.50 # ...of the previous two non-redundant : 2432
% 0.16/0.50 # ...aggressively subsumed : 0
% 0.16/0.50 # Contextual simplify-reflections : 36
% 0.16/0.50 # Paramodulations : 2669
% 0.16/0.50 # Factorizations : 0
% 0.16/0.50 # NegExts : 0
% 0.16/0.50 # Equation resolutions : 27
% 0.16/0.50 # Total rewrite steps : 2392
% 0.16/0.50 # Propositional unsat checks : 0
% 0.16/0.50 # Propositional check models : 0
% 0.16/0.50 # Propositional check unsatisfiable : 0
% 0.16/0.50 # Propositional clauses : 0
% 0.16/0.50 # Propositional clauses after purity: 0
% 0.16/0.50 # Propositional unsat core size : 0
% 0.16/0.50 # Propositional preprocessing time : 0.000
% 0.16/0.50 # Propositional encoding time : 0.000
% 0.16/0.50 # Propositional solver time : 0.000
% 0.16/0.50 # Success case prop preproc time : 0.000
% 0.16/0.50 # Success case prop encoding time : 0.000
% 0.16/0.50 # Success case prop solver time : 0.000
% 0.16/0.50 # Current number of processed clauses : 273
% 0.16/0.50 # Positive orientable unit clauses : 26
% 0.16/0.50 # Positive unorientable unit clauses: 0
% 0.16/0.50 # Negative unit clauses : 11
% 0.16/0.50 # Non-unit-clauses : 236
% 0.16/0.50 # Current number of unprocessed clauses: 1690
% 0.16/0.50 # ...number of literals in the above : 9805
% 0.16/0.50 # Current number of archived formulas : 0
% 0.16/0.50 # Current number of archived clauses : 118
% 0.16/0.50 # Clause-clause subsumption calls (NU) : 9015
% 0.16/0.50 # Rec. Clause-clause subsumption calls : 2780
% 0.16/0.50 # Non-unit clause-clause subsumptions : 369
% 0.16/0.50 # Unit Clause-clause subsumption calls : 486
% 0.16/0.50 # Rewrite failures with RHS unbound : 0
% 0.16/0.50 # BW rewrite match attempts : 3
% 0.16/0.50 # BW rewrite match successes : 3
% 0.16/0.50 # Condensation attempts : 0
% 0.16/0.50 # Condensation successes : 0
% 0.16/0.50 # Termbank termtop insertions : 50383
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.066 s
% 0.16/0.50 # System time : 0.003 s
% 0.16/0.50 # Total time : 0.069 s
% 0.16/0.50 # Maximum resident set size: 1952 pages
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.070 s
% 0.16/0.50 # System time : 0.006 s
% 0.16/0.50 # Total time : 0.075 s
% 0.16/0.50 # Maximum resident set size: 1848 pages
% 0.16/0.50 % E---3.1 exiting
% 0.16/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------