TSTP Solution File: SWC279+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:22 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 119 ( 18 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 150 ( 52 ~; 50 |; 32 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn; 20 !; 8 ?)
% 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)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ? [X8] :
( ssItem(X8)
& ( ( ~ leq(X5,X8)
& memberP(X7,X8) )
| ( ~ leq(X8,X5)
& memberP(X6,X8) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X1
| ! [X12] :
( ssItem(X12)
=> ( ( ~ memberP(X10,X12)
| leq(X12,X9) )
& ( ~ memberP(X11,X12)
| leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Jp7pieY9SG/E---3.1_30369.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ? [X8] :
( ssItem(X8)
& ( ( ~ leq(X5,X8)
& memberP(X7,X8) )
| ( ~ leq(X8,X5)
& memberP(X6,X8) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X1
| ! [X12] :
( ssItem(X12)
=> ( ( ~ memberP(X10,X12)
| leq(X12,X9) )
& ( ~ memberP(X11,X12)
| leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( leq(X17,X20)
| ~ memberP(X19,X20)
| ~ ssItem(X20)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk3_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( leq(X20,X17)
| ~ memberP(X18,X20)
| ~ ssItem(X20)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk3_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ssItem(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0
& ssItem(esk8_0)
& ( memberP(esk7_0,esk8_0)
| memberP(esk6_0,esk8_0) )
& ( ~ leq(esk5_0,esk8_0)
| memberP(esk6_0,esk8_0) )
& ( memberP(esk7_0,esk8_0)
| ~ leq(esk8_0,esk5_0) )
& ( ~ leq(esk5_0,esk8_0)
| ~ leq(esk8_0,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,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( leq(X1,X2)
| ~ memberP(X3,X2)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(X4,cons(X1,nil)),X3) != esk3_0
| ~ ssList(X4)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk3_0,
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( ~ leq(esk5_0,esk8_0)
| ~ leq(esk8_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( leq(esk5_0,X1)
| ~ memberP(esk7_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
ssItem(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( memberP(esk7_0,esk8_0)
| ~ leq(esk8_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( leq(X1,X2)
| ~ memberP(X3,X1)
| ~ ssItem(X1)
| ~ ssList(X4)
| app(app(X3,cons(X2,nil)),X4) != esk3_0
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( memberP(esk6_0,esk8_0)
| ~ leq(esk5_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( memberP(esk7_0,esk8_0)
| memberP(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
~ leq(esk8_0,esk5_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( leq(X1,esk5_0)
| ~ memberP(esk6_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_6]),c_0_8]),c_0_7]),c_0_9])]) ).
cnf(c_0_19,negated_conjecture,
memberP(esk6_0,esk8_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_12])]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 01:39:46 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.Jp7pieY9SG/E---3.1_30369.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_1 with pid 30475 completed with status 0
% 0.20/0.51 # Result found by new_bool_1
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30481 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 96
% 0.20/0.51 # Removed by relevancy pruning/SinE : 66
% 0.20/0.51 # Initial clauses : 62
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 62
% 0.20/0.51 # Processed clauses : 174
% 0.20/0.51 # ...of these trivial : 2
% 0.20/0.51 # ...subsumed : 11
% 0.20/0.51 # ...remaining for further processing : 161
% 0.20/0.51 # Other redundant clauses eliminated : 11
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 13
% 0.20/0.51 # Backward-rewritten : 3
% 0.20/0.51 # Generated clauses : 309
% 0.20/0.51 # ...of the previous two non-redundant : 253
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 9
% 0.20/0.51 # Paramodulations : 295
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 15
% 0.20/0.51 # Total rewrite steps : 190
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 83
% 0.20/0.51 # Positive orientable unit clauses : 19
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 4
% 0.20/0.51 # Non-unit-clauses : 60
% 0.20/0.51 # Current number of unprocessed clauses: 184
% 0.20/0.51 # ...number of literals in the above : 966
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 74
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 880
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 225
% 0.20/0.51 # Non-unit clause-clause subsumptions : 19
% 0.20/0.51 # Unit Clause-clause subsumption calls : 96
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 2
% 0.20/0.51 # BW rewrite match successes : 2
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 10427
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.017 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.021 s
% 0.20/0.51 # Maximum resident set size: 2036 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.020 s
% 0.20/0.51 # System time : 0.008 s
% 0.20/0.51 # Total time : 0.027 s
% 0.20/0.51 # Maximum resident set size: 1800 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------