TSTP Solution File: SWC398+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC398+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:59 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 12 unt; 0 def)
% Number of atoms : 99 ( 24 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 120 ( 40 ~; 39 |; 25 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn; 21 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X1,X9)
| memberP(X2,X9) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zCFhAxDE0P/E---3.1_1956.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.zCFhAxDE0P/E---3.1_1956.p',ax36) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X1,X9)
| memberP(X2,X9) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_3,negated_conjecture,
! [X15,X16,X17] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk3_0 )
& ssItem(esk6_0)
& memberP(esk1_0,esk6_0)
& ~ memberP(esk2_0,esk6_0)
& ( nil = esk4_0
| nil != esk3_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_4,plain,
! [X30,X31,X32] :
( ( ~ memberP(app(X31,X32),X30)
| memberP(X31,X30)
| memberP(X32,X30)
| ~ ssList(X32)
| ~ ssList(X31)
| ~ ssItem(X30) )
& ( ~ memberP(X31,X30)
| memberP(app(X31,X32),X30)
| ~ ssList(X32)
| ~ ssList(X31)
| ~ ssItem(X30) )
& ( ~ memberP(X32,X30)
| memberP(app(X31,X32),X30)
| ~ ssList(X32)
| ~ ssList(X31)
| ~ ssItem(X30) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
cnf(c_0_5,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
~ memberP(esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,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_10,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,negated_conjecture,
memberP(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
~ memberP(esk4_0,esk6_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( memberP(esk4_0,X1)
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
memberP(esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC398+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n007.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 01:32:24 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.zCFhAxDE0P/E---3.1_1956.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_1 with pid 2035 completed with status 0
% 0.17/0.46 # Result found by new_bool_1
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2038 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 96
% 0.17/0.46 # Removed by relevancy pruning/SinE : 72
% 0.17/0.46 # Initial clauses : 57
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 57
% 0.17/0.46 # Processed clauses : 164
% 0.17/0.46 # ...of these trivial : 5
% 0.17/0.46 # ...subsumed : 12
% 0.17/0.46 # ...remaining for further processing : 147
% 0.17/0.46 # Other redundant clauses eliminated : 11
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 327
% 0.17/0.46 # ...of the previous two non-redundant : 260
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 4
% 0.17/0.46 # Paramodulations : 313
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 15
% 0.17/0.46 # Total rewrite steps : 160
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 88
% 0.17/0.46 # Positive orientable unit clauses : 14
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 2
% 0.17/0.46 # Non-unit-clauses : 72
% 0.17/0.46 # Current number of unprocessed clauses: 208
% 0.17/0.46 # ...number of literals in the above : 946
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 55
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 603
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 245
% 0.17/0.46 # Non-unit clause-clause subsumptions : 16
% 0.17/0.46 # Unit Clause-clause subsumption calls : 1
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 0
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 9598
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.011 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.014 s
% 0.17/0.46 # Maximum resident set size: 2036 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.014 s
% 0.17/0.46 # System time : 0.005 s
% 0.17/0.46 # Total time : 0.019 s
% 0.17/0.46 # Maximum resident set size: 1796 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------