TSTP Solution File: SWC104+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC104+1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:23:23 EDT 2024
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 145 ( 38 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 179 ( 67 ~; 59 |; 32 &)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 29 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ totalorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& leq(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ totalorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& leq(X8,X6) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( neq(X1,nil)
& frontsegP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_7,negated_conjecture,
! [X259,X260,X261,X262] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ssList(esk52_0)
& app(esk50_0,esk52_0) = esk51_0
& totalorderedP(esk50_0)
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(cons(X259,nil),X260) != esk52_0
| ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,cons(X261,nil)) != esk50_0
| ~ leq(X261,X259) )
& ( nil = esk51_0
| nil != esk50_0 )
& ( ~ neq(esk48_0,nil)
| ~ frontsegP(esk49_0,esk48_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,plain,
! [X112,X113] :
( ( ~ neq(X112,X113)
| X112 != X113
| ~ ssList(X113)
| ~ ssList(X112) )
& ( X112 = X113
| neq(X112,X113)
| ~ ssList(X113)
| ~ ssList(X112) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_9,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk51_0
| nil != esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X23,X24,X26] :
( ( ssList(esk6_2(X23,X24))
| ~ frontsegP(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) )
& ( app(X24,esk6_2(X23,X24)) = X23
| ~ frontsegP(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) )
& ( ~ ssList(X26)
| app(X24,X26) != X23
| frontsegP(X23,X24)
| ~ ssList(X24)
| ~ ssList(X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])])]) ).
fof(c_0_15,plain,
! [X133,X134] :
( ~ ssList(X133)
| ~ ssList(X134)
| ssList(app(X133,X134)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ frontsegP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( neq(nil,nil)
| esk50_0 != nil ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( ~ frontsegP(esk51_0,esk50_0)
| ~ neq(esk50_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_10]),c_0_17]) ).
cnf(c_0_25,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_27,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_28,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_22]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,negated_conjecture,
~ frontsegP(esk51_0,esk50_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_26])]),c_0_27]) ).
cnf(c_0_32,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_28,c_0_29]),c_0_26]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC104+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 03:49:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.22/0.54 # Version: 3.1.0
% 0.22/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 5371 completed with status 0
% 0.22/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.22/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 5381 completed with status 0
% 0.22/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.22/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.22/0.54 # Preprocessing time : 0.002 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Theorem
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 96
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 203
% 0.22/0.54 # Removed in clause preprocessing : 2
% 0.22/0.54 # Initial clauses in saturation : 201
% 0.22/0.54 # Processed clauses : 381
% 0.22/0.54 # ...of these trivial : 2
% 0.22/0.54 # ...subsumed : 16
% 0.22/0.54 # ...remaining for further processing : 363
% 0.22/0.54 # Other redundant clauses eliminated : 27
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 6
% 0.22/0.54 # Backward-rewritten : 0
% 0.22/0.54 # Generated clauses : 97
% 0.22/0.54 # ...of the previous two non-redundant : 72
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 5
% 0.22/0.54 # Paramodulations : 72
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 27
% 0.22/0.54 # Disequality decompositions : 0
% 0.22/0.54 # Total rewrite steps : 48
% 0.22/0.54 # ...of those cached : 42
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 139
% 0.22/0.54 # Positive orientable unit clauses : 22
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 5
% 0.22/0.54 # Non-unit-clauses : 112
% 0.22/0.54 # Current number of unprocessed clauses: 83
% 0.22/0.54 # ...number of literals in the above : 422
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 201
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 12478
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 3399
% 0.22/0.54 # Non-unit clause-clause subsumptions : 19
% 0.22/0.54 # Unit Clause-clause subsumption calls : 24
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 0
% 0.22/0.54 # BW rewrite match successes : 0
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 20222
% 0.22/0.54 # Search garbage collected termcells : 4371
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.028 s
% 0.22/0.54 # System time : 0.002 s
% 0.22/0.54 # Total time : 0.030 s
% 0.22/0.54 # Maximum resident set size: 2480 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.085 s
% 0.22/0.54 # System time : 0.014 s
% 0.22/0.54 # Total time : 0.099 s
% 0.22/0.54 # Maximum resident set size: 1824 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------