TSTP Solution File: SWC220+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC220+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:24:32 EDT 2024
% Result : Theorem 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 154 ( 40 equ)
% Maximal formula atoms : 46 ( 5 avg)
% Number of connectives : 201 ( 73 ~; 78 |; 34 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,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(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,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(X268,esk53_0)
| ~ memberP(esk54_0,X268)
| ~ memberP(esk55_0,X268)
| ~ leq(esk53_0,X268)
| nil = esk50_0 ) ),
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)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( ssList(esk55_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( ssList(esk54_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( ssItem(esk53_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( leq(X1,esk53_0)
| nil = esk50_0
| ~ ssItem(X1)
| ~ memberP(esk54_0,X1)
| ~ memberP(esk55_0,X1)
| ~ leq(esk53_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,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_2]) ).
cnf(c_0_11,negated_conjecture,
app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_5]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk55_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_4]),c_0_5]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk54_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_4]),c_0_5]) ).
cnf(c_0_14,negated_conjecture,
ssItem(esk53_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_4]),c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( memberP(X1,esk52_3(X2,X3,X1))
| ~ ssList(X1)
| app(app(X3,cons(X2,nil)),X1) != esk48_0
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,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_2]) ).
cnf(c_0_17,negated_conjecture,
( leq(X1,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_2]) ).
cnf(c_0_18,negated_conjecture,
( leq(X1,esk53_0)
| ~ leq(esk53_0,X1)
| ~ memberP(esk54_0,X1)
| ~ memberP(esk55_0,X1)
| ~ ssItem(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_4]),c_0_5]) ).
cnf(c_0_19,negated_conjecture,
memberP(esk54_0,esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
memberP(esk55_0,esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_13]),c_0_12]),c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_22,negated_conjecture,
leq(esk53_0,esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_23,negated_conjecture,
( ~ leq(esk52_3(X1,X2,X3),X1)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_24,negated_conjecture,
leq(esk52_3(esk53_0,esk54_0,esk55_0),esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
$false,
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_11]),c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC220+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 02:58:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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.54 # Version: 3.1.0
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1486 completed with status 0
% 0.19/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.19/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.19/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with pid 1497 completed with status 0
% 0.19/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.19/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.19/0.54 # Preprocessing time : 0.003 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Theorem
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 96
% 0.19/0.54 # Removed by relevancy pruning/SinE : 0
% 0.19/0.54 # Initial clauses : 207
% 0.19/0.54 # Removed in clause preprocessing : 2
% 0.19/0.54 # Initial clauses in saturation : 205
% 0.19/0.54 # Processed clauses : 476
% 0.19/0.54 # ...of these trivial : 2
% 0.19/0.54 # ...subsumed : 19
% 0.19/0.54 # ...remaining for further processing : 455
% 0.19/0.54 # Other redundant clauses eliminated : 59
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 1
% 0.19/0.54 # Backward-rewritten : 6
% 0.19/0.54 # Generated clauses : 772
% 0.19/0.54 # ...of the previous two non-redundant : 664
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 2
% 0.19/0.54 # Paramodulations : 710
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 64
% 0.19/0.54 # Disequality decompositions : 0
% 0.19/0.54 # Total rewrite steps : 473
% 0.19/0.54 # ...of those cached : 444
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 226
% 0.19/0.54 # Positive orientable unit clauses : 43
% 0.19/0.54 # Positive unorientable unit clauses: 0
% 0.19/0.54 # Negative unit clauses : 3
% 0.19/0.54 # Non-unit-clauses : 180
% 0.19/0.54 # Current number of unprocessed clauses: 584
% 0.19/0.54 # ...number of literals in the above : 3596
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 206
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 19118
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 3815
% 0.19/0.54 # Non-unit clause-clause subsumptions : 9
% 0.19/0.54 # Unit Clause-clause subsumption calls : 133
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 4
% 0.19/0.54 # BW rewrite match successes : 4
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 35605
% 0.19/0.54 # Search garbage collected termcells : 4509
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.054 s
% 0.19/0.54 # System time : 0.003 s
% 0.19/0.54 # Total time : 0.058 s
% 0.19/0.54 # Maximum resident set size: 2536 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.222 s
% 0.19/0.54 # System time : 0.020 s
% 0.19/0.54 # Total time : 0.242 s
% 0.19/0.54 # Maximum resident set size: 1828 pages
% 0.19/0.54 % E---3.1 exiting
% 0.19/0.54 % E exiting
%------------------------------------------------------------------------------