TSTP Solution File: SWC294-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC294-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:25:22 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 43 ( 26 unt; 4 nHn; 41 RR)
% Number of literals : 73 ( 16 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_9,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
~ strictorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
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(clause80,axiom,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause3) ).
cnf(c_0_14,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_15,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_16,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_17,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_18,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
~ strictorderedP(sk1),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_21,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_14 ).
cnf(c_0_22,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_15 ).
cnf(c_0_23,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_24,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
c_0_16 ).
cnf(c_0_25,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_17 ).
cnf(c_0_26,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,negated_conjecture,
~ strictorderedP(sk1),
c_0_20 ).
cnf(c_0_31,plain,
( strictorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ strictorderedP(sk3),
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_35,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_36,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_37,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_38,plain,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
segmentP(nil,sk3),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_33])]) ).
cnf(c_0_41,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC294-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:29:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # sh5l with pid 7086 completed with status 0
% 0.19/0.51 # Result found by sh5l
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.51 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 7094 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.51 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.19/0.51 # Preprocessing time : 0.003 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 194
% 0.19/0.51 # Removed by relevancy pruning/SinE : 32
% 0.19/0.51 # Initial clauses : 162
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 162
% 0.19/0.51 # Processed clauses : 277
% 0.19/0.51 # ...of these trivial : 2
% 0.19/0.51 # ...subsumed : 9
% 0.19/0.51 # ...remaining for further processing : 266
% 0.19/0.51 # Other redundant clauses eliminated : 24
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 1
% 0.19/0.51 # Backward-rewritten : 9
% 0.19/0.51 # Generated clauses : 43
% 0.19/0.51 # ...of the previous two non-redundant : 37
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 2
% 0.19/0.51 # Paramodulations : 20
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 24
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 46
% 0.19/0.51 # ...of those cached : 36
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 81
% 0.19/0.51 # Positive orientable unit clauses : 38
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 42
% 0.19/0.51 # Current number of unprocessed clauses: 76
% 0.19/0.51 # ...number of literals in the above : 360
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 164
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 6246
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 930
% 0.19/0.51 # Non-unit clause-clause subsumptions : 10
% 0.19/0.51 # Unit Clause-clause subsumption calls : 71
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 2
% 0.19/0.51 # BW rewrite match successes : 2
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 8068
% 0.19/0.51 # Search garbage collected termcells : 613
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.019 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.024 s
% 0.19/0.51 # Maximum resident set size: 2200 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.023 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.030 s
% 0.19/0.51 # Maximum resident set size: 1896 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------