TSTP Solution File: SWC392+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC392+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:47 EDT 2023
% Result : Theorem 0.35s 0.60s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 18 unt; 0 def)
% Number of atoms : 160 ( 50 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 186 ( 66 ~; 71 |; 29 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn; 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6)
| ? [X7] :
( ssItem(X7)
& X6 != X7
& memberP(X4,X7)
& leq(X7,X6) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LnzaJku8Li/E---3.1_32373.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.LnzaJku8Li/E---3.1_32373.p',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LnzaJku8Li/E---3.1_32373.p',ax37) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LnzaJku8Li/E---3.1_32373.p',ax4) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.LnzaJku8Li/E---3.1_32373.p',ax17) ).
fof(ax39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/tmp/tmp.LnzaJku8Li/E---3.1_32373.p',ax39) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6)
| ? [X7] :
( ssItem(X7)
& X6 != X7
& memberP(X4,X7)
& leq(X7,X6) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_7,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_8,plain,
! [X155,X156,X157] :
( ( ~ memberP(cons(X156,X157),X155)
| X155 = X156
| memberP(X157,X155)
| ~ ssList(X157)
| ~ ssItem(X156)
| ~ ssItem(X155) )
& ( X155 != X156
| memberP(cons(X156,X157),X155)
| ~ ssList(X157)
| ~ ssItem(X156)
| ~ ssItem(X155) )
& ( ~ memberP(X157,X155)
| memberP(cons(X156,X157),X155)
| ~ ssList(X157)
| ~ ssItem(X156)
| ~ ssItem(X155) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
fof(c_0_9,negated_conjecture,
! [X258] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& memberP(esk48_0,esk52_0)
& ~ memberP(esk49_0,esk52_0)
& ( nil = esk51_0
| ssItem(esk53_0) )
& ( nil = esk50_0
| ssItem(esk53_0) )
& ( nil = esk51_0
| cons(esk53_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk53_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk53_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk53_0) )
& ( nil = esk51_0
| ~ ssItem(X258)
| esk53_0 = X258
| ~ memberP(esk51_0,X258)
| ~ leq(X258,esk53_0) )
& ( nil = esk50_0
| ~ ssItem(X258)
| esk53_0 = X258
| ~ memberP(esk51_0,X258)
| ~ leq(X258,esk53_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_6])])])])]) ).
fof(c_0_10,plain,
! [X158] :
( ~ ssItem(X158)
| ~ memberP(nil,X158) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_11,plain,
! [X18,X20] :
( ( ssItem(esk5_1(X18))
| ~ singletonP(X18)
| ~ ssList(X18) )
& ( cons(esk5_1(X18),nil) = X18
| ~ singletonP(X18)
| ~ ssList(X18) )
& ( ~ ssItem(X20)
| cons(X20,nil) != X18
| singletonP(X18)
| ~ ssList(X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
cnf(c_0_12,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk50_0
| cons(esk53_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk50_0
| ssItem(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
memberP(esk48_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( singletonP(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
~ memberP(esk49_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( esk50_0 = nil
| esk53_0 = X1
| ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk51_0
| cons(esk53_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk51_0
| ssItem(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
~ memberP(esk51_0,esk52_0),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( esk52_0 = esk53_0
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
( nil = esk50_0
| memberP(esk51_0,esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_33,plain,
~ singletonP(nil),
inference(fof_simplification,[status(thm)],[ax39]) ).
cnf(c_0_34,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,plain,
~ singletonP(nil),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_38,negated_conjecture,
~ memberP(nil,esk52_0),
inference(rw,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_35]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC392+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n021.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Oct 3 01:52:01 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.LnzaJku8Li/E---3.1_32373.p
% 0.35/0.60 # Version: 3.1pre001
% 0.35/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.60 # Starting sh5l with 300s (1) cores
% 0.35/0.60 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 32539 completed with status 0
% 0.35/0.60 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.35/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.60 # No SInE strategy applied
% 0.35/0.60 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.35/0.60 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.60 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.35/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.35/0.60 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.35/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.35/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.35/0.60 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 32554 completed with status 0
% 0.35/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.35/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.60 # No SInE strategy applied
% 0.35/0.60 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.35/0.60 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.60 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.35/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.35/0.60 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.35/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.35/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.35/0.60 # Preprocessing time : 0.005 s
% 0.35/0.60 # Presaturation interreduction done
% 0.35/0.60
% 0.35/0.60 # Proof found!
% 0.35/0.60 # SZS status Theorem
% 0.35/0.60 # SZS output start CNFRefutation
% See solution above
% 0.35/0.60 # Parsed axioms : 96
% 0.35/0.60 # Removed by relevancy pruning/SinE : 0
% 0.35/0.60 # Initial clauses : 207
% 0.35/0.60 # Removed in clause preprocessing : 2
% 0.35/0.60 # Initial clauses in saturation : 205
% 0.35/0.60 # Processed clauses : 553
% 0.35/0.60 # ...of these trivial : 3
% 0.35/0.60 # ...subsumed : 85
% 0.35/0.60 # ...remaining for further processing : 464
% 0.35/0.60 # Other redundant clauses eliminated : 55
% 0.35/0.60 # Clauses deleted for lack of memory : 0
% 0.35/0.60 # Backward-subsumed : 3
% 0.35/0.60 # Backward-rewritten : 56
% 0.35/0.60 # Generated clauses : 663
% 0.35/0.60 # ...of the previous two non-redundant : 551
% 0.35/0.60 # ...aggressively subsumed : 0
% 0.35/0.60 # Contextual simplify-reflections : 35
% 0.35/0.60 # Paramodulations : 605
% 0.35/0.60 # Factorizations : 0
% 0.35/0.60 # NegExts : 0
% 0.35/0.60 # Equation resolutions : 60
% 0.35/0.60 # Total rewrite steps : 380
% 0.35/0.60 # Propositional unsat checks : 0
% 0.35/0.60 # Propositional check models : 0
% 0.35/0.60 # Propositional check unsatisfiable : 0
% 0.35/0.60 # Propositional clauses : 0
% 0.35/0.60 # Propositional clauses after purity: 0
% 0.35/0.60 # Propositional unsat core size : 0
% 0.35/0.60 # Propositional preprocessing time : 0.000
% 0.35/0.60 # Propositional encoding time : 0.000
% 0.35/0.60 # Propositional solver time : 0.000
% 0.35/0.60 # Success case prop preproc time : 0.000
% 0.35/0.60 # Success case prop encoding time : 0.000
% 0.35/0.60 # Success case prop solver time : 0.000
% 0.35/0.60 # Current number of processed clauses : 183
% 0.35/0.60 # Positive orientable unit clauses : 21
% 0.35/0.60 # Positive unorientable unit clauses: 0
% 0.35/0.60 # Negative unit clauses : 3
% 0.35/0.60 # Non-unit-clauses : 159
% 0.35/0.60 # Current number of unprocessed clauses: 400
% 0.35/0.60 # ...number of literals in the above : 2469
% 0.35/0.60 # Current number of archived formulas : 0
% 0.35/0.60 # Current number of archived clauses : 258
% 0.35/0.60 # Clause-clause subsumption calls (NU) : 17412
% 0.35/0.60 # Rec. Clause-clause subsumption calls : 4771
% 0.35/0.60 # Non-unit clause-clause subsumptions : 121
% 0.35/0.60 # Unit Clause-clause subsumption calls : 92
% 0.35/0.60 # Rewrite failures with RHS unbound : 0
% 0.35/0.60 # BW rewrite match attempts : 4
% 0.35/0.60 # BW rewrite match successes : 4
% 0.35/0.60 # Condensation attempts : 0
% 0.35/0.60 # Condensation successes : 0
% 0.35/0.60 # Termbank termtop insertions : 26918
% 0.35/0.60
% 0.35/0.60 # -------------------------------------------------
% 0.35/0.60 # User time : 0.057 s
% 0.35/0.60 # System time : 0.007 s
% 0.35/0.60 # Total time : 0.064 s
% 0.35/0.60 # Maximum resident set size: 2492 pages
% 0.35/0.60
% 0.35/0.60 # -------------------------------------------------
% 0.35/0.60 # User time : 0.251 s
% 0.35/0.60 # System time : 0.027 s
% 0.35/0.60 # Total time : 0.279 s
% 0.35/0.60 # Maximum resident set size: 1800 pages
% 0.35/0.60 % E---3.1 exiting
% 0.35/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------