TSTP Solution File: SWC010+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC010+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:41:01 EDT 2023
% Result : Theorem 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 131 ( 36 equ)
% Maximal formula atoms : 52 ( 6 avg)
% Number of connectives : 165 ( 55 ~; 59 |; 37 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 18 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(X6,X7) = X1 ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X4
| app(X9,X10) != X3
| ? [X11] :
( ssItem(X11)
& X8 != X11
& memberP(X4,X11)
& geq(X11,X8) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ReFjL9Nsqq/E---3.1_29763.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(X6,X7) = X1 ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X4
| app(X9,X10) != X3
| ? [X11] :
( ssItem(X11)
& X8 != X11
& memberP(X4,X11)
& geq(X11,X8) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X16,X17,X18,X22] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssItem(X16)
| ~ ssList(X17)
| ~ ssList(X18)
| app(app(X17,cons(X16,nil)),X18) != esk2_0
| app(X17,X18) != esk1_0 )
& ( ~ neq(esk4_0,nil)
| ~ ssItem(X16)
| ~ ssList(X17)
| ~ ssList(X18)
| app(app(X17,cons(X16,nil)),X18) != esk2_0
| app(X17,X18) != esk1_0 )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| ssList(esk6_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk6_0) )
& ( neq(esk2_0,nil)
| ssList(esk7_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk7_0) )
& ( neq(esk2_0,nil)
| app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0 )
& ( neq(esk2_0,nil)
| app(esk6_0,esk7_0) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| app(esk6_0,esk7_0) = esk3_0 )
& ( neq(esk2_0,nil)
| ~ ssItem(X22)
| esk5_0 = X22
| ~ memberP(esk4_0,X22)
| ~ geq(X22,esk5_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssItem(X22)
| esk5_0 = X22
| ~ memberP(esk4_0,X22)
| ~ geq(X22,esk5_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_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( app(esk6_0,esk7_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ssList(esk7_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk4_0
| app(X1,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_5]),c_0_7])]) ).
cnf(c_0_15,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
app(esk6_0,esk7_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_7])]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_7])]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_7])]) ).
cnf(c_0_20,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_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC010+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n021.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 02:02:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.ReFjL9Nsqq/E---3.1_29763.p
% 0.16/0.48 # Version: 3.1pre001
% 0.16/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 # Starting sh5l with 300s (1) cores
% 0.16/0.48 # new_bool_3 with pid 29841 completed with status 0
% 0.16/0.48 # Result found by new_bool_3
% 0.16/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29844 completed with status 0
% 0.16/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.48 # Preprocessing time : 0.002 s
% 0.16/0.48 # Presaturation interreduction done
% 0.16/0.48
% 0.16/0.48 # Proof found!
% 0.16/0.48 # SZS status Theorem
% 0.16/0.48 # SZS output start CNFRefutation
% See solution above
% 0.16/0.48 # Parsed axioms : 96
% 0.16/0.48 # Removed by relevancy pruning/SinE : 60
% 0.16/0.48 # Initial clauses : 76
% 0.16/0.48 # Removed in clause preprocessing : 0
% 0.16/0.48 # Initial clauses in saturation : 76
% 0.16/0.48 # Processed clauses : 149
% 0.16/0.48 # ...of these trivial : 10
% 0.16/0.48 # ...subsumed : 5
% 0.16/0.48 # ...remaining for further processing : 134
% 0.16/0.48 # Other redundant clauses eliminated : 9
% 0.16/0.48 # Clauses deleted for lack of memory : 0
% 0.16/0.48 # Backward-subsumed : 2
% 0.16/0.48 # Backward-rewritten : 0
% 0.16/0.48 # Generated clauses : 117
% 0.16/0.48 # ...of the previous two non-redundant : 97
% 0.16/0.48 # ...aggressively subsumed : 0
% 0.16/0.48 # Contextual simplify-reflections : 0
% 0.16/0.48 # Paramodulations : 108
% 0.16/0.48 # Factorizations : 0
% 0.16/0.48 # NegExts : 0
% 0.16/0.48 # Equation resolutions : 10
% 0.16/0.48 # Total rewrite steps : 107
% 0.16/0.48 # Propositional unsat checks : 0
% 0.16/0.48 # Propositional check models : 0
% 0.16/0.48 # Propositional check unsatisfiable : 0
% 0.16/0.48 # Propositional clauses : 0
% 0.16/0.48 # Propositional clauses after purity: 0
% 0.16/0.48 # Propositional unsat core size : 0
% 0.16/0.48 # Propositional preprocessing time : 0.000
% 0.16/0.48 # Propositional encoding time : 0.000
% 0.16/0.48 # Propositional solver time : 0.000
% 0.16/0.48 # Success case prop preproc time : 0.000
% 0.16/0.48 # Success case prop encoding time : 0.000
% 0.16/0.48 # Success case prop solver time : 0.000
% 0.16/0.48 # Current number of processed clauses : 62
% 0.16/0.48 # Positive orientable unit clauses : 14
% 0.16/0.48 # Positive unorientable unit clauses: 0
% 0.16/0.48 # Negative unit clauses : 1
% 0.16/0.48 # Non-unit-clauses : 47
% 0.16/0.48 # Current number of unprocessed clauses: 84
% 0.16/0.48 # ...number of literals in the above : 342
% 0.16/0.48 # Current number of archived formulas : 0
% 0.16/0.48 # Current number of archived clauses : 66
% 0.16/0.48 # Clause-clause subsumption calls (NU) : 1108
% 0.16/0.48 # Rec. Clause-clause subsumption calls : 309
% 0.16/0.48 # Non-unit clause-clause subsumptions : 7
% 0.16/0.48 # Unit Clause-clause subsumption calls : 0
% 0.16/0.48 # Rewrite failures with RHS unbound : 0
% 0.16/0.48 # BW rewrite match attempts : 0
% 0.16/0.48 # BW rewrite match successes : 0
% 0.16/0.48 # Condensation attempts : 0
% 0.16/0.48 # Condensation successes : 0
% 0.16/0.48 # Termbank termtop insertions : 7861
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.011 s
% 0.16/0.48 # System time : 0.002 s
% 0.16/0.48 # Total time : 0.013 s
% 0.16/0.48 # Maximum resident set size: 2036 pages
% 0.16/0.48
% 0.16/0.48 # -------------------------------------------------
% 0.16/0.48 # User time : 0.013 s
% 0.16/0.48 # System time : 0.005 s
% 0.16/0.48 # Total time : 0.018 s
% 0.16/0.48 # Maximum resident set size: 1804 pages
% 0.16/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------