TSTP Solution File: SWC222+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC222+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:42:06 EDT 2023
% Result : Theorem 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 189 ( 50 equ)
% Maximal formula atoms : 46 ( 5 avg)
% Number of connectives : 255 ( 101 ~; 98 |; 38 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 70 ( 0 sgn; 35 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p',ax38) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X9,X12)
& memberP(X10,X12)
& memberP(X11,X12)
& lt(X9,X12) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p',ax28) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p',ax16) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p',ax20) ).
fof(c_0_7,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X9,X12)
& memberP(X10,X12)
& memberP(X11,X12)
& lt(X9,X12) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,plain,
! [X163] :
( ~ ssItem(X163)
| ~ memberP(nil,X163) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_10,negated_conjecture,
! [X261,X262,X263,X268] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& nil != esk48_0
& ( ssItem(esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( memberP(X262,esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( memberP(X263,esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( leq(X261,esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( ~ leq(esk52_3(X261,X262,X263),X261)
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( ssItem(esk53_0)
| nil = esk50_0 )
& ( ssList(esk54_0)
| nil = esk50_0 )
& ( ssList(esk55_0)
| nil = esk50_0 )
& ( app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0
| nil = esk50_0 )
& ( ~ ssItem(X268)
| leq(esk53_0,X268)
| ~ memberP(esk54_0,X268)
| ~ memberP(esk55_0,X268)
| ~ lt(esk53_0,X268)
| nil = esk50_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
cnf(c_0_11,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| ~ ssList(X3)
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X141] :
( ~ ssList(X141)
| app(nil,X141) = X141 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_17,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]) ).
cnf(c_0_18,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X226,X227] :
( ~ ssList(X226)
| ~ ssItem(X227)
| cons(X227,X226) = app(cons(X227,nil),X226) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_20,negated_conjecture,
( app(cons(X1,nil),X2) != esk48_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X117,X118] :
( ~ ssList(X117)
| ~ ssItem(X118)
| ssList(cons(X118,X117)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_23,negated_conjecture,
( cons(X1,X2) != esk48_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X125] :
( ( ssList(esk44_1(X125))
| nil = X125
| ~ ssList(X125) )
& ( ssItem(esk45_1(X125))
| nil = X125
| ~ ssList(X125) )
& ( cons(esk45_1(X125),esk44_1(X125)) = X125
| nil = X125
| ~ ssList(X125) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_26,negated_conjecture,
( cons(X1,X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13])]) ).
cnf(c_0_27,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(esk44_1(esk48_0))
| ~ ssItem(esk45_1(esk48_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]),c_0_28])]),c_0_29]) ).
cnf(c_0_31,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
~ ssList(esk44_1(esk48_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]),c_0_29]) ).
cnf(c_0_33,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC222+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n001.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Oct 3 02:27:07 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.WhD4byczW7/E---3.1_20829.p
% 0.14/0.49 # Version: 3.1pre001
% 0.14/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 # Starting sh5l with 300s (1) cores
% 0.14/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 20906 completed with status 0
% 0.14/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 # No SInE strategy applied
% 0.14/0.49 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.14/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.49 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.49 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.14/0.49 # SAT001_MinMin_p005000_rr_RG with pid 20914 completed with status 0
% 0.14/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49 # No SInE strategy applied
% 0.14/0.49 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.14/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.49 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.14/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.49 # Preprocessing time : 0.003 s
% 0.14/0.49 # Presaturation interreduction done
% 0.14/0.49
% 0.14/0.49 # Proof found!
% 0.14/0.49 # SZS status Theorem
% 0.14/0.49 # SZS output start CNFRefutation
% See solution above
% 0.14/0.49 # Parsed axioms : 96
% 0.14/0.49 # Removed by relevancy pruning/SinE : 0
% 0.14/0.49 # Initial clauses : 207
% 0.14/0.49 # Removed in clause preprocessing : 2
% 0.14/0.49 # Initial clauses in saturation : 205
% 0.14/0.49 # Processed clauses : 760
% 0.14/0.49 # ...of these trivial : 2
% 0.14/0.49 # ...subsumed : 155
% 0.14/0.49 # ...remaining for further processing : 603
% 0.14/0.49 # Other redundant clauses eliminated : 96
% 0.14/0.49 # Clauses deleted for lack of memory : 0
% 0.14/0.49 # Backward-subsumed : 61
% 0.14/0.49 # Backward-rewritten : 2
% 0.14/0.49 # Generated clauses : 1394
% 0.14/0.49 # ...of the previous two non-redundant : 1197
% 0.14/0.49 # ...aggressively subsumed : 0
% 0.14/0.49 # Contextual simplify-reflections : 30
% 0.14/0.49 # Paramodulations : 1295
% 0.14/0.49 # Factorizations : 0
% 0.14/0.49 # NegExts : 0
% 0.14/0.49 # Equation resolutions : 101
% 0.14/0.49 # Total rewrite steps : 849
% 0.14/0.49 # Propositional unsat checks : 0
% 0.14/0.49 # Propositional check models : 0
% 0.14/0.49 # Propositional check unsatisfiable : 0
% 0.14/0.49 # Propositional clauses : 0
% 0.14/0.49 # Propositional clauses after purity: 0
% 0.14/0.49 # Propositional unsat core size : 0
% 0.14/0.49 # Propositional preprocessing time : 0.000
% 0.14/0.49 # Propositional encoding time : 0.000
% 0.14/0.49 # Propositional solver time : 0.000
% 0.14/0.49 # Success case prop preproc time : 0.000
% 0.14/0.49 # Success case prop encoding time : 0.000
% 0.14/0.49 # Success case prop solver time : 0.000
% 0.14/0.49 # Current number of processed clauses : 318
% 0.14/0.49 # Positive orientable unit clauses : 24
% 0.14/0.49 # Positive unorientable unit clauses: 0
% 0.14/0.49 # Negative unit clauses : 7
% 0.14/0.49 # Non-unit-clauses : 287
% 0.14/0.49 # Current number of unprocessed clauses: 784
% 0.14/0.49 # ...number of literals in the above : 5289
% 0.14/0.49 # Current number of archived formulas : 0
% 0.14/0.49 # Current number of archived clauses : 262
% 0.14/0.49 # Clause-clause subsumption calls (NU) : 32773
% 0.14/0.49 # Rec. Clause-clause subsumption calls : 8758
% 0.14/0.49 # Non-unit clause-clause subsumptions : 200
% 0.14/0.49 # Unit Clause-clause subsumption calls : 239
% 0.14/0.49 # Rewrite failures with RHS unbound : 0
% 0.14/0.49 # BW rewrite match attempts : 2
% 0.14/0.49 # BW rewrite match successes : 2
% 0.14/0.49 # Condensation attempts : 0
% 0.14/0.49 # Condensation successes : 0
% 0.14/0.49 # Termbank termtop insertions : 43162
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.074 s
% 0.14/0.49 # System time : 0.006 s
% 0.14/0.49 # Total time : 0.080 s
% 0.14/0.49 # Maximum resident set size: 2584 pages
% 0.14/0.49
% 0.14/0.49 # -------------------------------------------------
% 0.14/0.49 # User time : 0.346 s
% 0.14/0.49 # System time : 0.023 s
% 0.14/0.49 # Total time : 0.370 s
% 0.14/0.49 # Maximum resident set size: 1808 pages
% 0.14/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------