TSTP Solution File: SWC219+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC219+1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:05 EDT 2023
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 161 ( 55 equ)
% Maximal formula atoms : 54 ( 5 avg)
% Number of connectives : 211 ( 80 ~; 79 |; 35 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 49 ( 0 sgn; 25 !; 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) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ( cons(X9,nil) != X3
| ~ memberP(X4,X9)
| ? [X10] :
( ssItem(X10)
& X9 != X10
& memberP(X4,X10)
& leq(X10,X9) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.VaaKDX3Xs4/E---3.1_22272.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/tmp/tmp.VaaKDX3Xs4/E---3.1_22272.p',ax38) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.VaaKDX3Xs4/E---3.1_22272.p',ax81) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.VaaKDX3Xs4/E---3.1_22272.p',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.VaaKDX3Xs4/E---3.1_22272.p',ax28) ).
fof(c_0_5,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) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ( cons(X9,nil) != X3
| ~ memberP(X4,X9)
| ? [X10] :
( ssItem(X10)
& X9 != X10
& memberP(X4,X10)
& leq(X10,X9) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_7,negated_conjecture,
! [X15,X16,X17,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssItem(esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( memberP(X16,esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( memberP(X17,esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( leq(X15,esk5_3(X15,X16,X17))
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( ~ leq(esk5_3(X15,X16,X17),X15)
| ~ ssList(X17)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( nil = esk4_0
| ssItem(esk6_0) )
& ( nil = esk3_0
| ssItem(esk6_0) )
& ( nil = esk4_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk6_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk6_0) )
& ( nil = esk4_0
| ~ ssItem(X20)
| esk6_0 = X20
| ~ memberP(esk4_0,X20)
| ~ leq(X20,esk6_0) )
& ( nil = esk3_0
| ~ ssItem(X20)
| esk6_0 = X20
| ~ memberP(esk4_0,X20)
| ~ leq(X20,esk6_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_5])])])])]) ).
fof(c_0_8,plain,
! [X51] :
( ~ ssItem(X51)
| ~ memberP(nil,X51) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_9,plain,
! [X65,X66] :
( ~ ssList(X65)
| ~ ssItem(X66)
| cons(X66,X65) = app(cons(X66,nil),X65) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk3_0
| cons(esk6_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk3_0
| ssItem(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( memberP(X1,esk5_3(X2,X3,X1))
| ~ ssList(X1)
| app(app(X3,cons(X2,nil)),X1) != esk1_0
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_17,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
cons(esk6_0,nil) = esk1_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_12]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk6_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk1_0
| ~ ssList(X1)
| ~ ssItem(esk5_3(X2,X1,nil))
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( cons(esk6_0,X1) = app(esk1_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
app(esk1_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_16])]) ).
fof(c_0_25,plain,
! [X69] :
( ~ ssList(X69)
| app(nil,X69) = X69 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_26,negated_conjecture,
( app(app(X1,esk1_0),nil) != esk1_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24]),c_0_19]),c_0_16])]) ).
cnf(c_0_27,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_16]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC219+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 01:58:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.VaaKDX3Xs4/E---3.1_22272.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # new_bool_1 with pid 22351 completed with status 0
% 0.19/0.52 # Result found by new_bool_1
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.19/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 22353 completed with status 0
% 0.19/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.002 s
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Theorem
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 96
% 0.19/0.52 # Removed by relevancy pruning/SinE : 66
% 0.19/0.52 # Initial clauses : 65
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 65
% 0.19/0.52 # Processed clauses : 241
% 0.19/0.52 # ...of these trivial : 18
% 0.19/0.52 # ...subsumed : 76
% 0.19/0.52 # ...remaining for further processing : 147
% 0.19/0.52 # Other redundant clauses eliminated : 3
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 1
% 0.19/0.52 # Backward-rewritten : 7
% 0.19/0.52 # Generated clauses : 780
% 0.19/0.52 # ...of the previous two non-redundant : 652
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 17
% 0.19/0.52 # Paramodulations : 766
% 0.19/0.52 # Factorizations : 2
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 12
% 0.19/0.52 # Total rewrite steps : 634
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 137
% 0.19/0.52 # Positive orientable unit clauses : 19
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 4
% 0.19/0.52 # Non-unit-clauses : 114
% 0.19/0.52 # Current number of unprocessed clauses: 472
% 0.19/0.52 # ...number of literals in the above : 2375
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 8
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 1867
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 450
% 0.19/0.52 # Non-unit clause-clause subsumptions : 56
% 0.19/0.52 # Unit Clause-clause subsumption calls : 43
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 3
% 0.19/0.52 # BW rewrite match successes : 2
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 17788
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.024 s
% 0.19/0.52 # System time : 0.003 s
% 0.19/0.52 # Total time : 0.027 s
% 0.19/0.52 # Maximum resident set size: 2028 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.028 s
% 0.19/0.52 # System time : 0.004 s
% 0.19/0.52 # Total time : 0.033 s
% 0.19/0.52 # Maximum resident set size: 1800 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------