TSTP Solution File: SWC076+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC076+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:39:12 EDT 2023
% Result : Theorem 0.38s 0.55s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 174 ( 52 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 217 ( 78 ~; 74 |; 46 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn; 31 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,X3),X7) != X4
| ~ equalelemsP(X3)
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X6
& ? [X10] :
( ssList(X10)
& app(cons(X8,nil),X10) = X3 ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X7
& ? [X13] :
( ssList(X13)
& app(X13,cons(X11,nil)) = X3 ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p3cgcirUvL/E---3.1_31858.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p3cgcirUvL/E---3.1_31858.p',ax15) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.p3cgcirUvL/E---3.1_31858.p',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.p3cgcirUvL/E---3.1_31858.p',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.p3cgcirUvL/E---3.1_31858.p',ax55) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,X3),X7) != X4
| ~ equalelemsP(X3)
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X6
& ? [X10] :
( ssList(X10)
& app(cons(X8,nil),X10) = X3 ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X7
& ? [X13] :
( ssList(X13)
& app(X13,cons(X11,nil)) = X3 ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,negated_conjecture,
! [X18,X21,X22,X23,X24,X25,X26] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(esk2_0,X18)
| ~ segmentP(esk1_0,X18) )
& ssList(esk5_0)
& ssList(esk6_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X21)
| ~ ssList(X22)
| app(X22,cons(X21,nil)) != esk5_0
| ~ ssList(X23)
| app(cons(X21,nil),X23) != esk3_0 )
& ( ~ ssItem(X24)
| ~ ssList(X25)
| app(cons(X24,nil),X25) != esk6_0
| ~ ssList(X26)
| app(X26,cons(X24,nil)) != esk3_0 )
& ( nil = esk4_0
| nil != esk3_0 )
& ( nil != esk2_0
| nil != esk1_0 ) ),
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_7,plain,
! [X92,X93] :
( ( ~ neq(X92,X93)
| X92 != X93
| ~ ssList(X93)
| ~ ssList(X92) )
& ( X92 = X93
| neq(X92,X93)
| ~ ssList(X93)
| ~ ssList(X92) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_8,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X72,X73,X76,X77] :
( ( ssList(esk15_2(X72,X73))
| ~ segmentP(X72,X73)
| ~ ssList(X73)
| ~ ssList(X72) )
& ( ssList(esk16_2(X72,X73))
| ~ segmentP(X72,X73)
| ~ ssList(X73)
| ~ ssList(X72) )
& ( app(app(esk15_2(X72,X73),X73),esk16_2(X72,X73)) = X72
| ~ segmentP(X72,X73)
| ~ ssList(X73)
| ~ ssList(X72) )
& ( ~ ssList(X76)
| ~ ssList(X77)
| app(app(X76,X73),X77) != X72
| segmentP(X72,X73)
| ~ ssList(X73)
| ~ ssList(X72) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_12,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_17,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_22,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_9]),c_0_10]) ).
cnf(c_0_29,negated_conjecture,
neq(esk3_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_21]),c_0_26]),c_0_27])]) ).
fof(c_0_31,plain,
! [X83] :
( ~ ssList(X83)
| segmentP(X83,X83) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_32,negated_conjecture,
~ segmentP(esk3_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_21])]) ).
cnf(c_0_33,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC076+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 01:50:29 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 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.p3cgcirUvL/E---3.1_31858.p
% 0.38/0.55 # Version: 3.1pre001
% 0.38/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.55 # Starting sh5l with 300s (1) cores
% 0.38/0.55 # new_bool_3 with pid 31977 completed with status 0
% 0.38/0.55 # Result found by new_bool_3
% 0.38/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.38/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.38/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31982 completed with status 0
% 0.38/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.38/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.38/0.55 # Preprocessing time : 0.002 s
% 0.38/0.55 # Presaturation interreduction done
% 0.38/0.55
% 0.38/0.55 # Proof found!
% 0.38/0.55 # SZS status Theorem
% 0.38/0.55 # SZS output start CNFRefutation
% See solution above
% 0.38/0.55 # Parsed axioms : 96
% 0.38/0.55 # Removed by relevancy pruning/SinE : 67
% 0.38/0.55 # Initial clauses : 62
% 0.38/0.55 # Removed in clause preprocessing : 0
% 0.38/0.55 # Initial clauses in saturation : 62
% 0.38/0.55 # Processed clauses : 212
% 0.38/0.55 # ...of these trivial : 2
% 0.38/0.55 # ...subsumed : 6
% 0.38/0.55 # ...remaining for further processing : 204
% 0.38/0.55 # Other redundant clauses eliminated : 13
% 0.38/0.55 # Clauses deleted for lack of memory : 0
% 0.38/0.55 # Backward-subsumed : 7
% 0.38/0.55 # Backward-rewritten : 0
% 0.38/0.55 # Generated clauses : 522
% 0.38/0.55 # ...of the previous two non-redundant : 482
% 0.38/0.55 # ...aggressively subsumed : 0
% 0.38/0.55 # Contextual simplify-reflections : 1
% 0.38/0.55 # Paramodulations : 503
% 0.38/0.55 # Factorizations : 0
% 0.38/0.55 # NegExts : 0
% 0.38/0.55 # Equation resolutions : 17
% 0.38/0.55 # Total rewrite steps : 168
% 0.38/0.55 # Propositional unsat checks : 0
% 0.38/0.55 # Propositional check models : 0
% 0.38/0.55 # Propositional check unsatisfiable : 0
% 0.38/0.55 # Propositional clauses : 0
% 0.38/0.55 # Propositional clauses after purity: 0
% 0.38/0.55 # Propositional unsat core size : 0
% 0.38/0.55 # Propositional preprocessing time : 0.000
% 0.38/0.55 # Propositional encoding time : 0.000
% 0.38/0.55 # Propositional solver time : 0.000
% 0.38/0.55 # Success case prop preproc time : 0.000
% 0.38/0.55 # Success case prop encoding time : 0.000
% 0.38/0.55 # Success case prop solver time : 0.000
% 0.38/0.55 # Current number of processed clauses : 129
% 0.38/0.55 # Positive orientable unit clauses : 30
% 0.38/0.55 # Positive unorientable unit clauses: 0
% 0.38/0.55 # Negative unit clauses : 6
% 0.38/0.55 # Non-unit-clauses : 93
% 0.38/0.55 # Current number of unprocessed clauses: 386
% 0.38/0.55 # ...number of literals in the above : 1501
% 0.38/0.55 # Current number of archived formulas : 0
% 0.38/0.55 # Current number of archived clauses : 69
% 0.38/0.55 # Clause-clause subsumption calls (NU) : 1173
% 0.38/0.55 # Rec. Clause-clause subsumption calls : 488
% 0.38/0.55 # Non-unit clause-clause subsumptions : 7
% 0.38/0.55 # Unit Clause-clause subsumption calls : 154
% 0.38/0.55 # Rewrite failures with RHS unbound : 0
% 0.38/0.55 # BW rewrite match attempts : 0
% 0.38/0.55 # BW rewrite match successes : 0
% 0.38/0.55 # Condensation attempts : 0
% 0.38/0.55 # Condensation successes : 0
% 0.38/0.55 # Termbank termtop insertions : 12364
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.023 s
% 0.38/0.55 # System time : 0.001 s
% 0.38/0.55 # Total time : 0.024 s
% 0.38/0.55 # Maximum resident set size: 2040 pages
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.027 s
% 0.38/0.55 # System time : 0.004 s
% 0.38/0.55 # Total time : 0.030 s
% 0.38/0.55 # Maximum resident set size: 1804 pages
% 0.38/0.55 % E---3.1 exiting
% 0.38/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------