TSTP Solution File: SWC325+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC325+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:35 EDT 2023
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 14 unt; 0 def)
% Number of atoms : 134 ( 55 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 163 ( 62 ~; 56 |; 25 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn; 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(X5,X6) = X2
& app(X6,X5) = X1 ) )
| ( nil != X3
& nil = X4 )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zLIXhdpMhJ/E---3.1_15098.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zLIXhdpMhJ/E---3.1_15098.p',ax83) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.zLIXhdpMhJ/E---3.1_15098.p',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zLIXhdpMhJ/E---3.1_15098.p',ax15) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.zLIXhdpMhJ/E---3.1_15098.p',ax16) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(X5,X6) = X2
& app(X6,X5) = X1 ) )
| ( nil != X3
& nil = X4 )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
! [X13,X14] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X13)
| ~ ssList(X14)
| app(X13,X14) != esk2_0
| app(X14,X13) != esk1_0 )
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk6_0)
| ~ neq(esk4_0,nil) )
& ( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) )
& ( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ) ),
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_7,plain,
! [X43,X44] :
( ( nil = X44
| nil != app(X43,X44)
| ~ ssList(X44)
| ~ ssList(X43) )
& ( nil = X43
| nil != app(X43,X44)
| ~ ssList(X44)
| ~ ssList(X43) )
& ( nil != X44
| nil != X43
| nil = app(X43,X44)
| ~ ssList(X44)
| ~ ssList(X43) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != esk2_0
| app(X2,X1) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_13,plain,
! [X19,X20] :
( ( ~ neq(X19,X20)
| X19 != X20
| ~ ssList(X20)
| ~ ssList(X19) )
& ( X19 = X20
| neq(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( app(X1,X2) != esk3_0
| app(X2,X1) != esk4_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_16,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]),c_0_12])]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_21,negated_conjecture,
esk4_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_12])]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = esk3_0,
inference(sr,[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_12]),c_0_20])]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_12]),c_0_20])]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk6_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_12]),c_0_20])]),c_0_21]) ).
fof(c_0_27,plain,
! [X46,X47] :
( ~ ssList(X46)
| ~ ssItem(X47)
| ssList(cons(X47,X46)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
~ ssList(cons(esk5_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_30,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_12]),c_0_20])]),c_0_21]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_12]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC325+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n023.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 02:14:52 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.zLIXhdpMhJ/E---3.1_15098.p
% 0.14/0.44 # Version: 3.1pre001
% 0.14/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 # Starting sh5l with 300s (1) cores
% 0.14/0.44 # new_bool_3 with pid 15181 completed with status 0
% 0.14/0.44 # Result found by new_bool_3
% 0.14/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.14/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 15185 completed with status 0
% 0.14/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.14/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.14/0.44 # Preprocessing time : 0.001 s
% 0.14/0.44 # Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 # Proof found!
% 0.14/0.44 # SZS status Theorem
% 0.14/0.44 # SZS output start CNFRefutation
% See solution above
% 0.14/0.44 # Parsed axioms : 96
% 0.14/0.44 # Removed by relevancy pruning/SinE : 77
% 0.14/0.44 # Initial clauses : 39
% 0.14/0.44 # Removed in clause preprocessing : 0
% 0.14/0.44 # Initial clauses in saturation : 39
% 0.14/0.44 # Processed clauses : 90
% 0.14/0.44 # ...of these trivial : 2
% 0.14/0.44 # ...subsumed : 4
% 0.14/0.44 # ...remaining for further processing : 84
% 0.14/0.44 # Other redundant clauses eliminated : 10
% 0.14/0.44 # Clauses deleted for lack of memory : 0
% 0.14/0.44 # Backward-subsumed : 1
% 0.14/0.44 # Backward-rewritten : 8
% 0.14/0.44 # Generated clauses : 58
% 0.14/0.44 # ...of the previous two non-redundant : 42
% 0.14/0.44 # ...aggressively subsumed : 0
% 0.14/0.44 # Contextual simplify-reflections : 1
% 0.14/0.44 # Paramodulations : 47
% 0.14/0.44 # Factorizations : 0
% 0.14/0.44 # NegExts : 0
% 0.14/0.44 # Equation resolutions : 12
% 0.14/0.44 # Total rewrite steps : 70
% 0.14/0.44 # Propositional unsat checks : 0
% 0.14/0.44 # Propositional check models : 0
% 0.14/0.44 # Propositional check unsatisfiable : 0
% 0.14/0.44 # Propositional clauses : 0
% 0.14/0.44 # Propositional clauses after purity: 0
% 0.14/0.44 # Propositional unsat core size : 0
% 0.14/0.44 # Propositional preprocessing time : 0.000
% 0.14/0.44 # Propositional encoding time : 0.000
% 0.14/0.44 # Propositional solver time : 0.000
% 0.14/0.44 # Success case prop preproc time : 0.000
% 0.14/0.44 # Success case prop encoding time : 0.000
% 0.14/0.44 # Success case prop solver time : 0.000
% 0.14/0.44 # Current number of processed clauses : 35
% 0.14/0.44 # Positive orientable unit clauses : 12
% 0.14/0.44 # Positive unorientable unit clauses: 0
% 0.14/0.44 # Negative unit clauses : 6
% 0.14/0.44 # Non-unit-clauses : 17
% 0.14/0.44 # Current number of unprocessed clauses: 28
% 0.14/0.44 # ...number of literals in the above : 104
% 0.14/0.44 # Current number of archived formulas : 0
% 0.14/0.44 # Current number of archived clauses : 46
% 0.14/0.44 # Clause-clause subsumption calls (NU) : 96
% 0.14/0.44 # Rec. Clause-clause subsumption calls : 40
% 0.14/0.44 # Non-unit clause-clause subsumptions : 1
% 0.14/0.44 # Unit Clause-clause subsumption calls : 22
% 0.14/0.44 # Rewrite failures with RHS unbound : 0
% 0.14/0.44 # BW rewrite match attempts : 4
% 0.14/0.44 # BW rewrite match successes : 4
% 0.14/0.44 # Condensation attempts : 0
% 0.14/0.44 # Condensation successes : 0
% 0.14/0.44 # Termbank termtop insertions : 4291
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.008 s
% 0.14/0.44 # System time : 0.001 s
% 0.14/0.44 # Total time : 0.009 s
% 0.14/0.44 # Maximum resident set size: 1904 pages
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.010 s
% 0.14/0.44 # System time : 0.003 s
% 0.14/0.44 # Total time : 0.013 s
% 0.14/0.44 # Maximum resident set size: 1800 pages
% 0.14/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------