TSTP Solution File: SWC025+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC025+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:41:06 EDT 2023
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 160 ( 59 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 183 ( 66 ~; 76 |; 26 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 20 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zqeqYqrHFx/E---3.1_2819.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.zqeqYqrHFx/E---3.1_2819.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.zqeqYqrHFx/E---3.1_2819.p',ax37) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zqeqYqrHFx/E---3.1_2819.p',ax20) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& duplicatefreeP(esk3_0)
& ( memberP(esk4_0,X11)
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) )
& ( memberP(esk3_0,X11)
| ~ memberP(esk4_0,X11)
| ~ ssItem(X11) )
& ( nil = esk1_0
| nil = esk2_0 )
& ( nil != esk2_0
| nil = esk2_0 )
& ( nil = esk1_0
| nil != esk1_0 )
& ( nil != esk2_0
| nil != esk1_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_4])])])])]) ).
fof(c_0_6,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_7,plain,
! [X26,X27,X28] :
( ( ~ memberP(cons(X27,X28),X26)
| X26 = X27
| memberP(X28,X26)
| ~ ssList(X28)
| ~ ssItem(X27)
| ~ ssItem(X26) )
& ( X26 != X27
| memberP(cons(X27,X28),X26)
| ~ ssList(X28)
| ~ ssItem(X27)
| ~ ssItem(X26) )
& ( ~ memberP(X28,X26)
| memberP(cons(X27,X28),X26)
| ~ ssList(X28)
| ~ ssItem(X27)
| ~ ssItem(X26) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
fof(c_0_8,plain,
! [X12] :
( ( ssList(esk5_1(X12))
| nil = X12
| ~ ssList(X12) )
& ( ssItem(esk6_1(X12))
| nil = X12
| ~ ssList(X12) )
& ( cons(esk6_1(X12),esk5_1(X12)) = X12
| nil = X12
| ~ ssList(X12) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_9,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk1_0
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X29] :
( ~ ssItem(X29)
| ~ memberP(nil,X29) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
cnf(c_0_14,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( cons(esk6_1(X1),esk5_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,plain,
( ssItem(esk6_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ssList(esk5_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( memberP(esk4_0,X1)
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( esk4_0 = nil
| esk3_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_22,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( cons(esk6_1(esk3_0),esk5_1(esk3_0)) = esk3_0
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( esk3_0 = nil
| ssItem(esk6_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( esk3_0 = nil
| ssList(esk5_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,negated_conjecture,
( esk3_0 = nil
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( esk3_0 = nil
| memberP(esk3_0,esk6_1(esk3_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( cons(esk6_1(esk4_0),esk5_1(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( esk4_0 = nil
| ssItem(esk6_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( esk4_0 = nil
| ssList(esk5_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_10]),c_0_12]) ).
cnf(c_0_35,negated_conjecture,
esk3_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( memberP(esk3_0,X1)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_37,negated_conjecture,
( esk4_0 = nil
| memberP(esk4_0,esk6_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_32]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
( ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_35]),c_0_22]) ).
cnf(c_0_40,negated_conjecture,
memberP(esk4_0,esk6_1(esk4_0)),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
ssItem(esk6_1(esk4_0)),
inference(sr,[status(thm)],[c_0_32,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SWC025+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n001.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:34:52 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.zqeqYqrHFx/E---3.1_2819.p
% 0.14/0.43 # Version: 3.1pre001
% 0.14/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # new_bool_3 with pid 2897 completed with status 0
% 0.14/0.43 # Result found by new_bool_3
% 0.14/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2901 completed with status 0
% 0.14/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.43 # Preprocessing time : 0.001 s
% 0.14/0.43 # Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Theorem
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 96
% 0.14/0.43 # Removed by relevancy pruning/SinE : 72
% 0.14/0.43 # Initial clauses : 57
% 0.14/0.43 # Removed in clause preprocessing : 2
% 0.14/0.43 # Initial clauses in saturation : 55
% 0.14/0.43 # Processed clauses : 144
% 0.14/0.43 # ...of these trivial : 2
% 0.14/0.43 # ...subsumed : 5
% 0.14/0.43 # ...remaining for further processing : 137
% 0.14/0.43 # Other redundant clauses eliminated : 12
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 0
% 0.14/0.43 # Backward-rewritten : 14
% 0.14/0.43 # Generated clauses : 279
% 0.14/0.43 # ...of the previous two non-redundant : 227
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 12
% 0.14/0.43 # Paramodulations : 261
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 16
% 0.14/0.43 # Total rewrite steps : 98
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 62
% 0.14/0.43 # Positive orientable unit clauses : 12
% 0.14/0.43 # Positive unorientable unit clauses: 0
% 0.14/0.43 # Negative unit clauses : 2
% 0.14/0.43 # Non-unit-clauses : 48
% 0.14/0.43 # Current number of unprocessed clauses: 191
% 0.14/0.43 # ...number of literals in the above : 889
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 71
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 519
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 177
% 0.14/0.43 # Non-unit clause-clause subsumptions : 17
% 0.14/0.43 # Unit Clause-clause subsumption calls : 53
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 1
% 0.14/0.43 # BW rewrite match successes : 1
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 9003
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.015 s
% 0.14/0.43 # System time : 0.000 s
% 0.14/0.43 # Total time : 0.015 s
% 0.14/0.43 # Maximum resident set size: 2008 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.018 s
% 0.14/0.43 # System time : 0.001 s
% 0.14/0.43 # Total time : 0.019 s
% 0.14/0.43 # Maximum resident set size: 1800 pages
% 0.14/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------