TSTP Solution File: SWC322+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC322+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:42:34 EDT 2023
% Result : Theorem 0.14s 1.05s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 155 ( 87 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 180 ( 67 ~; 66 |; 28 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 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] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) != X3
& app(X6,cons(X5,nil)) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) = X1 ) ) )
& ( nil != X2
| nil = X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HUGbemuGOY/E---3.1_22156.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.HUGbemuGOY/E---3.1_22156.p',ax83) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.HUGbemuGOY/E---3.1_22156.p',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.HUGbemuGOY/E---3.1_22156.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.HUGbemuGOY/E---3.1_22156.p',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) != X3
& app(X6,cons(X5,nil)) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) = X1 ) ) )
& ( nil != X2
| nil = X1 ) ) ) ) ) ) ),
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
& ( ~ ssItem(X13)
| ~ ssList(X14)
| app(cons(X13,nil),X14) = esk3_0
| app(X14,cons(X13,nil)) != esk4_0 )
& ( nil = esk3_0
| nil != esk4_0 )
& ( nil = esk2_0
| ssItem(esk5_0) )
& ( nil != esk1_0
| ssItem(esk5_0) )
& ( nil = esk2_0
| ssList(esk6_0) )
& ( nil != esk1_0
| ssList(esk6_0) )
& ( nil = esk2_0
| app(esk6_0,cons(esk5_0,nil)) = esk2_0 )
& ( nil != esk1_0
| app(esk6_0,cons(esk5_0,nil)) = esk2_0 )
& ( nil = esk2_0
| app(cons(esk5_0,nil),esk6_0) != esk1_0 )
& ( nil != esk1_0
| app(cons(esk5_0,nil),esk6_0) != 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_5])])])])]) ).
cnf(c_0_7,negated_conjecture,
( app(cons(X1,nil),X2) = esk3_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,cons(X1,nil)) != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( app(cons(X1,nil),X2) = esk1_0
| app(X2,cons(X1,nil)) != esk2_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( nil = esk2_0
| app(esk6_0,cons(esk5_0,nil)) = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk2_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( nil = esk2_0
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk2_0
| app(cons(esk5_0,nil),esk6_0) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8]),c_0_9]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15]) ).
fof(c_0_18,plain,
! [X39,X40] :
( ( nil = X40
| nil != app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) )
& ( nil = X39
| nil != app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) )
& ( nil != X40
| nil != X39
| nil = app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_19,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
( ssList(esk6_0)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_22,plain,
! [X34,X35] :
( ~ ssList(X34)
| ~ ssItem(X35)
| cons(X35,X34) = app(cons(X35,nil),X34) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_23,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_17]),c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_20])]) ).
fof(c_0_26,plain,
! [X42,X43] :
( ~ ssList(X42)
| ~ ssItem(X43)
| ssList(cons(X43,X42)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_27,negated_conjecture,
( ssItem(esk5_0)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
( nil != esk1_0
| app(cons(esk5_0,nil),esk6_0) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( esk6_0 = nil
| ~ ssList(cons(esk5_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_31,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_20])]) ).
cnf(c_0_34,negated_conjecture,
( cons(esk5_0,esk6_0) != esk1_0
| esk1_0 != nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27]),c_0_21]) ).
cnf(c_0_35,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
cons(esk5_0,esk6_0) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_20]),c_0_20])]) ).
cnf(c_0_37,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_38,negated_conjecture,
app(nil,cons(esk5_0,nil)) = nil,
inference(rw,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
cons(esk5_0,nil) != nil,
inference(rw,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
~ ssList(cons(esk5_0,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32])]),c_0_39]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.72 % Problem : SWC322+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.73 % Command : run_E %s %d THM
% 0.10/0.92 % Computer : n001.cluster.edu
% 0.10/0.92 % Model : x86_64 x86_64
% 0.10/0.92 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.92 % Memory : 8042.1875MB
% 0.10/0.92 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.92 % CPULimit : 2400
% 0.10/0.92 % WCLimit : 300
% 0.10/0.92 % DateTime : Tue Oct 3 02:27:37 EDT 2023
% 0.10/0.92 % CPUTime :
% 0.14/1.03 Running first-order model finding
% 0.14/1.03 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.HUGbemuGOY/E---3.1_22156.p
% 0.14/1.05 # Version: 3.1pre001
% 0.14/1.05 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.05 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/1.05 # Starting new_bool_3 with 300s (1) cores
% 0.14/1.05 # Starting new_bool_1 with 300s (1) cores
% 0.14/1.05 # Starting sh5l with 300s (1) cores
% 0.14/1.05 # new_bool_1 with pid 22235 completed with status 0
% 0.14/1.05 # Result found by new_bool_1
% 0.14/1.05 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.05 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/1.05 # Starting new_bool_3 with 300s (1) cores
% 0.14/1.05 # Starting new_bool_1 with 300s (1) cores
% 0.14/1.05 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/1.05 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.14/1.05 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/1.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.14/1.05 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 22237 completed with status 0
% 0.14/1.05 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.14/1.05 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.05 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/1.05 # Starting new_bool_3 with 300s (1) cores
% 0.14/1.05 # Starting new_bool_1 with 300s (1) cores
% 0.14/1.05 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/1.05 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.14/1.05 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/1.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.14/1.05 # Preprocessing time : 0.001 s
% 0.14/1.05 # Presaturation interreduction done
% 0.14/1.05
% 0.14/1.05 # Proof found!
% 0.14/1.05 # SZS status Theorem
% 0.14/1.05 # SZS output start CNFRefutation
% See solution above
% 0.14/1.05 # Parsed axioms : 96
% 0.14/1.05 # Removed by relevancy pruning/SinE : 79
% 0.14/1.05 # Initial clauses : 39
% 0.14/1.05 # Removed in clause preprocessing : 0
% 0.14/1.05 # Initial clauses in saturation : 39
% 0.14/1.05 # Processed clauses : 112
% 0.14/1.05 # ...of these trivial : 2
% 0.14/1.05 # ...subsumed : 8
% 0.14/1.05 # ...remaining for further processing : 102
% 0.14/1.05 # Other redundant clauses eliminated : 10
% 0.14/1.05 # Clauses deleted for lack of memory : 0
% 0.14/1.05 # Backward-subsumed : 0
% 0.14/1.05 # Backward-rewritten : 22
% 0.14/1.05 # Generated clauses : 127
% 0.14/1.05 # ...of the previous two non-redundant : 111
% 0.14/1.05 # ...aggressively subsumed : 0
% 0.14/1.05 # Contextual simplify-reflections : 15
% 0.14/1.05 # Paramodulations : 114
% 0.14/1.05 # Factorizations : 0
% 0.14/1.05 # NegExts : 0
% 0.14/1.05 # Equation resolutions : 14
% 0.14/1.05 # Total rewrite steps : 103
% 0.14/1.05 # Propositional unsat checks : 0
% 0.14/1.05 # Propositional check models : 0
% 0.14/1.05 # Propositional check unsatisfiable : 0
% 0.14/1.05 # Propositional clauses : 0
% 0.14/1.05 # Propositional clauses after purity: 0
% 0.14/1.05 # Propositional unsat core size : 0
% 0.14/1.05 # Propositional preprocessing time : 0.000
% 0.14/1.05 # Propositional encoding time : 0.000
% 0.14/1.05 # Propositional solver time : 0.000
% 0.14/1.05 # Success case prop preproc time : 0.000
% 0.14/1.05 # Success case prop encoding time : 0.000
% 0.14/1.05 # Success case prop solver time : 0.000
% 0.14/1.05 # Current number of processed clauses : 42
% 0.14/1.05 # Positive orientable unit clauses : 11
% 0.14/1.05 # Positive unorientable unit clauses: 0
% 0.14/1.05 # Negative unit clauses : 4
% 0.14/1.05 # Non-unit-clauses : 27
% 0.14/1.05 # Current number of unprocessed clauses: 74
% 0.14/1.05 # ...number of literals in the above : 359
% 0.14/1.05 # Current number of archived formulas : 0
% 0.14/1.05 # Current number of archived clauses : 59
% 0.14/1.05 # Clause-clause subsumption calls (NU) : 291
% 0.14/1.05 # Rec. Clause-clause subsumption calls : 120
% 0.14/1.05 # Non-unit clause-clause subsumptions : 20
% 0.14/1.05 # Unit Clause-clause subsumption calls : 23
% 0.14/1.05 # Rewrite failures with RHS unbound : 0
% 0.14/1.05 # BW rewrite match attempts : 3
% 0.14/1.05 # BW rewrite match successes : 3
% 0.14/1.05 # Condensation attempts : 0
% 0.14/1.05 # Condensation successes : 0
% 0.14/1.05 # Termbank termtop insertions : 5377
% 0.14/1.05
% 0.14/1.05 # -------------------------------------------------
% 0.14/1.05 # User time : 0.008 s
% 0.14/1.05 # System time : 0.002 s
% 0.14/1.05 # Total time : 0.010 s
% 0.14/1.05 # Maximum resident set size: 1988 pages
% 0.14/1.05
% 0.14/1.05 # -------------------------------------------------
% 0.14/1.05 # User time : 0.011 s
% 0.14/1.05 # System time : 0.004 s
% 0.14/1.05 # Total time : 0.015 s
% 0.14/1.05 # Maximum resident set size: 1800 pages
% 0.14/1.05 % E---3.1 exiting
%------------------------------------------------------------------------------