TSTP Solution File: SWC331+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC331+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:28 EDT 2023
% Result : Theorem 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 134 ( 27 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 163 ( 63 ~; 55 |; 24 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn; 31 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XrfVwgmTvX/E---3.1_5491.p',co1) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XrfVwgmTvX/E---3.1_5491.p',ax53) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.XrfVwgmTvX/E---3.1_5491.p',ax56) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.XrfVwgmTvX/E---3.1_5491.p',ax55) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.XrfVwgmTvX/E---3.1_5491.p',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.XrfVwgmTvX/E---3.1_5491.p',ax17) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_7,negated_conjecture,
! [X258,X259,X260] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& app(esk50_0,esk52_0) = esk51_0
& equalelemsP(esk50_0)
& ( ~ ssItem(X258)
| ~ ssList(X259)
| app(cons(X258,nil),X259) != esk52_0
| ~ ssList(X260)
| app(X260,cons(X258,nil)) != esk50_0 )
& ( nil = esk51_0
| nil != esk50_0 )
& ( ~ segmentP(esk49_0,esk48_0)
| ~ equalelemsP(esk48_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
| ~ equalelemsP(esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
equalelemsP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X186,X187,X188] :
( ~ ssList(X186)
| ~ ssList(X187)
| ~ ssList(X188)
| ~ segmentP(X186,X187)
| ~ segmentP(X187,X188)
| segmentP(X186,X188) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
~ segmentP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_9])]) ).
cnf(c_0_16,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_14,c_0_11]) ).
fof(c_0_19,plain,
! [X192,X193,X194,X195] :
( ~ ssList(X192)
| ~ ssList(X193)
| ~ ssList(X194)
| ~ ssList(X195)
| ~ segmentP(X192,X193)
| segmentP(app(app(X194,X192),X195),X193) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ segmentP(X1,esk50_0)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X191] :
( ~ ssList(X191)
| segmentP(X191,X191) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_23,negated_conjecture,
( ~ segmentP(esk51_0,app(app(X1,X2),X3))
| ~ segmentP(X2,esk50_0)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17])]) ).
cnf(c_0_24,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X137] :
( ~ ssList(X137)
| app(nil,X137) = X137 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_26,negated_conjecture,
( ~ segmentP(esk51_0,app(app(X1,esk50_0),X2))
| ~ ssList(app(app(X1,esk50_0),X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17])]) ).
cnf(c_0_27,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_29,negated_conjecture,
( ~ segmentP(esk51_0,app(esk50_0,X1))
| ~ ssList(app(esk50_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_17])]) ).
cnf(c_0_30,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
~ segmentP(esk51_0,esk51_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWC331+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.13/0.31 % Computer : n029.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.31 % CPULimit : 2400
% 0.17/0.31 % WCLimit : 300
% 0.17/0.31 % DateTime : Tue Oct 3 02:06:07 EDT 2023
% 0.17/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/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.XrfVwgmTvX/E---3.1_5491.p
% 0.17/0.51 # Version: 3.1pre001
% 0.17/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 # Starting sh5l with 300s (1) cores
% 0.17/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 5643 completed with status 0
% 0.17/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.51 # No SInE strategy applied
% 0.17/0.51 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.51 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.51 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.17/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 5659 completed with status 0
% 0.17/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.17/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.51 # No SInE strategy applied
% 0.17/0.51 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.51 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.51 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.17/0.51 # Preprocessing time : 0.003 s
% 0.17/0.51 # Presaturation interreduction done
% 0.17/0.51
% 0.17/0.51 # Proof found!
% 0.17/0.51 # SZS status Theorem
% 0.17/0.51 # SZS output start CNFRefutation
% See solution above
% 0.17/0.51 # Parsed axioms : 96
% 0.17/0.51 # Removed by relevancy pruning/SinE : 0
% 0.17/0.51 # Initial clauses : 202
% 0.17/0.51 # Removed in clause preprocessing : 2
% 0.17/0.51 # Initial clauses in saturation : 200
% 0.17/0.51 # Processed clauses : 794
% 0.17/0.51 # ...of these trivial : 5
% 0.17/0.51 # ...subsumed : 201
% 0.17/0.51 # ...remaining for further processing : 588
% 0.17/0.51 # Other redundant clauses eliminated : 100
% 0.17/0.51 # Clauses deleted for lack of memory : 0
% 0.17/0.51 # Backward-subsumed : 15
% 0.17/0.51 # Backward-rewritten : 10
% 0.17/0.51 # Generated clauses : 1461
% 0.17/0.51 # ...of the previous two non-redundant : 1203
% 0.17/0.51 # ...aggressively subsumed : 0
% 0.17/0.51 # Contextual simplify-reflections : 22
% 0.17/0.51 # Paramodulations : 1358
% 0.17/0.51 # Factorizations : 0
% 0.17/0.51 # NegExts : 0
% 0.17/0.51 # Equation resolutions : 105
% 0.17/0.51 # Total rewrite steps : 1186
% 0.17/0.51 # Propositional unsat checks : 0
% 0.17/0.51 # Propositional check models : 0
% 0.17/0.51 # Propositional check unsatisfiable : 0
% 0.17/0.51 # Propositional clauses : 0
% 0.17/0.51 # Propositional clauses after purity: 0
% 0.17/0.51 # Propositional unsat core size : 0
% 0.17/0.51 # Propositional preprocessing time : 0.000
% 0.17/0.51 # Propositional encoding time : 0.000
% 0.17/0.51 # Propositional solver time : 0.000
% 0.17/0.51 # Success case prop preproc time : 0.000
% 0.17/0.51 # Success case prop encoding time : 0.000
% 0.17/0.51 # Success case prop solver time : 0.000
% 0.17/0.51 # Current number of processed clauses : 346
% 0.17/0.51 # Positive orientable unit clauses : 39
% 0.17/0.51 # Positive unorientable unit clauses: 0
% 0.17/0.51 # Negative unit clauses : 6
% 0.17/0.51 # Non-unit-clauses : 301
% 0.17/0.51 # Current number of unprocessed clauses: 797
% 0.17/0.51 # ...number of literals in the above : 4947
% 0.17/0.51 # Current number of archived formulas : 0
% 0.17/0.51 # Current number of archived clauses : 219
% 0.17/0.51 # Clause-clause subsumption calls (NU) : 31343
% 0.17/0.51 # Rec. Clause-clause subsumption calls : 7854
% 0.17/0.51 # Non-unit clause-clause subsumptions : 223
% 0.17/0.51 # Unit Clause-clause subsumption calls : 632
% 0.17/0.51 # Rewrite failures with RHS unbound : 0
% 0.17/0.51 # BW rewrite match attempts : 9
% 0.17/0.51 # BW rewrite match successes : 9
% 0.17/0.51 # Condensation attempts : 0
% 0.17/0.51 # Condensation successes : 0
% 0.17/0.51 # Termbank termtop insertions : 42379
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.065 s
% 0.17/0.51 # System time : 0.009 s
% 0.17/0.51 # Total time : 0.074 s
% 0.17/0.51 # Maximum resident set size: 2484 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.343 s
% 0.17/0.51 # System time : 0.026 s
% 0.17/0.51 # Total time : 0.369 s
% 0.17/0.51 # Maximum resident set size: 1796 pages
% 0.17/0.51 % E---3.1 exiting
% 0.17/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------