TSTP Solution File: SWC404+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC404+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:43:01 EDT 2023
% Result : Theorem 0.41s 0.56s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 150 ( 30 equ)
% Maximal formula atoms : 29 ( 5 avg)
% Number of connectives : 186 ( 62 ~; 61 |; 43 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 3 ( 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 : 58 ( 0 sgn; 32 !; 16 ?)
% 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(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X1,X15)
| memberP(X2,X15) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.19nwK7tSWU/E---3.1_6589.p',co1) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.19nwK7tSWU/E---3.1_6589.p',ax36) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.19nwK7tSWU/E---3.1_6589.p',ax26) ).
fof(c_0_3,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(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X1,X15)
| memberP(X2,X15) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,plain,
! [X160,X161,X162] :
( ( ~ memberP(app(X161,X162),X160)
| memberP(X161,X160)
| memberP(X162,X160)
| ~ ssList(X162)
| ~ ssList(X161)
| ~ ssItem(X160) )
& ( ~ memberP(X161,X160)
| memberP(app(X161,X162),X160)
| ~ ssList(X162)
| ~ ssList(X161)
| ~ ssItem(X160) )
& ( ~ memberP(X162,X160)
| memberP(app(X161,X162),X160)
| ~ ssList(X162)
| ~ ssList(X161)
| ~ ssItem(X160) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
fof(c_0_5,negated_conjecture,
! [X266,X267,X268,X269,X270,X271,X272,X273] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& ssList(esk53_0)
& app(app(esk52_0,esk50_0),esk53_0) = esk51_0
& strictorderedP(esk50_0)
& ( ~ ssItem(X266)
| ~ ssList(X267)
| app(X267,cons(X266,nil)) != esk52_0
| ~ ssItem(X268)
| ~ ssList(X269)
| app(cons(X268,nil),X269) != esk50_0
| ~ lt(X266,X268) )
& ( ~ ssItem(X270)
| ~ ssList(X271)
| app(cons(X270,nil),X271) != esk53_0
| ~ ssItem(X272)
| ~ ssList(X273)
| app(X273,cons(X272,nil)) != esk50_0
| ~ lt(X272,X270) )
& ssItem(esk54_0)
& memberP(esk48_0,esk54_0)
& ~ memberP(esk49_0,esk54_0)
& ( nil = esk51_0
| nil != esk50_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( memberP(esk51_0,X1)
| ~ memberP(app(esk52_0,esk50_0),X1)
| ~ ssList(app(esk52_0,esk50_0))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_12,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
memberP(esk48_0,esk54_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ memberP(esk49_0,esk54_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( memberP(esk51_0,X1)
| ~ memberP(esk50_0,X1)
| ~ ssList(app(esk52_0,esk50_0))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
memberP(esk50_0,esk54_0),
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
~ memberP(esk51_0,esk54_0),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X139,X140] :
( ~ ssList(X139)
| ~ ssList(X140)
| ssList(app(X139,X140)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_23,negated_conjecture,
~ ssList(app(esk52_0,esk50_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_24,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC404+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 01:25:41 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.19nwK7tSWU/E---3.1_6589.p
% 0.41/0.56 # Version: 3.1pre001
% 0.41/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.56 # Starting sh5l with 300s (1) cores
% 0.41/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 6666 completed with status 0
% 0.41/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.41/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.56 # No SInE strategy applied
% 0.41/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.41/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.41/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.41/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.41/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.41/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.41/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 6677 completed with status 0
% 0.41/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.41/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.56 # No SInE strategy applied
% 0.41/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.41/0.56 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.41/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.41/0.56 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.41/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.41/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.41/0.56 # Preprocessing time : 0.003 s
% 0.41/0.56 # Presaturation interreduction done
% 0.41/0.56
% 0.41/0.56 # Proof found!
% 0.41/0.56 # SZS status Theorem
% 0.41/0.56 # SZS output start CNFRefutation
% See solution above
% 0.41/0.56 # Parsed axioms : 96
% 0.41/0.56 # Removed by relevancy pruning/SinE : 0
% 0.41/0.56 # Initial clauses : 206
% 0.41/0.56 # Removed in clause preprocessing : 2
% 0.41/0.56 # Initial clauses in saturation : 204
% 0.41/0.56 # Processed clauses : 459
% 0.41/0.56 # ...of these trivial : 2
% 0.41/0.56 # ...subsumed : 36
% 0.41/0.56 # ...remaining for further processing : 421
% 0.41/0.56 # Other redundant clauses eliminated : 49
% 0.41/0.56 # Clauses deleted for lack of memory : 0
% 0.41/0.56 # Backward-subsumed : 17
% 0.41/0.56 # Backward-rewritten : 1
% 0.41/0.56 # Generated clauses : 362
% 0.41/0.56 # ...of the previous two non-redundant : 289
% 0.41/0.56 # ...aggressively subsumed : 0
% 0.41/0.56 # Contextual simplify-reflections : 10
% 0.41/0.56 # Paramodulations : 311
% 0.41/0.56 # Factorizations : 0
% 0.41/0.56 # NegExts : 0
% 0.41/0.56 # Equation resolutions : 53
% 0.41/0.56 # Total rewrite steps : 147
% 0.41/0.56 # Propositional unsat checks : 0
% 0.41/0.56 # Propositional check models : 0
% 0.41/0.56 # Propositional check unsatisfiable : 0
% 0.41/0.56 # Propositional clauses : 0
% 0.41/0.56 # Propositional clauses after purity: 0
% 0.41/0.56 # Propositional unsat core size : 0
% 0.41/0.56 # Propositional preprocessing time : 0.000
% 0.41/0.56 # Propositional encoding time : 0.000
% 0.41/0.56 # Propositional solver time : 0.000
% 0.41/0.56 # Success case prop preproc time : 0.000
% 0.41/0.56 # Success case prop encoding time : 0.000
% 0.41/0.56 # Success case prop solver time : 0.000
% 0.41/0.56 # Current number of processed clauses : 182
% 0.41/0.56 # Positive orientable unit clauses : 25
% 0.41/0.56 # Positive unorientable unit clauses: 0
% 0.41/0.56 # Negative unit clauses : 4
% 0.41/0.56 # Non-unit-clauses : 153
% 0.41/0.56 # Current number of unprocessed clauses: 231
% 0.41/0.56 # ...number of literals in the above : 1410
% 0.41/0.56 # Current number of archived formulas : 0
% 0.41/0.56 # Current number of archived clauses : 216
% 0.41/0.56 # Clause-clause subsumption calls (NU) : 15335
% 0.41/0.56 # Rec. Clause-clause subsumption calls : 4102
% 0.41/0.56 # Non-unit clause-clause subsumptions : 51
% 0.41/0.56 # Unit Clause-clause subsumption calls : 13
% 0.41/0.56 # Rewrite failures with RHS unbound : 0
% 0.41/0.56 # BW rewrite match attempts : 1
% 0.41/0.56 # BW rewrite match successes : 1
% 0.41/0.56 # Condensation attempts : 0
% 0.41/0.56 # Condensation successes : 0
% 0.41/0.56 # Termbank termtop insertions : 22752
% 0.41/0.56
% 0.41/0.56 # -------------------------------------------------
% 0.41/0.56 # User time : 0.039 s
% 0.41/0.56 # System time : 0.006 s
% 0.41/0.56 # Total time : 0.045 s
% 0.41/0.56 # Maximum resident set size: 2540 pages
% 0.41/0.56
% 0.41/0.56 # -------------------------------------------------
% 0.41/0.56 # User time : 0.164 s
% 0.41/0.56 # System time : 0.016 s
% 0.41/0.56 # Total time : 0.180 s
% 0.41/0.56 # Maximum resident set size: 1820 pages
% 0.41/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------