TSTP Solution File: SWC288+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC288+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:24 EDT 2023
% Result : Timeout 0.50s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 100 ( 37 equ)
% Maximal formula atoms : 43 ( 6 avg)
% Number of connectives : 119 ( 34 ~; 44 |; 30 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 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 : 23 ( 0 sgn; 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2fS5lbaBxe/E---3.1_7846.p',co1) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.2fS5lbaBxe/E---3.1_7846.p',ax68) ).
fof(ax69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/tmp/tmp.2fS5lbaBxe/E---3.1_7846.p',ax69) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| strictorderedP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,negated_conjecture,
! [X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ~ strictorderedP(esk1_0)
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| ssList(esk6_0) )
& ( nil = esk3_0
| ssList(esk6_0) )
& ( nil = esk4_0
| ssList(esk7_0) )
& ( nil = esk3_0
| ssList(esk7_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk3_0
| app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
& ( nil = esk4_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk3_0
| ~ ssItem(X17)
| ~ memberP(esk6_0,X17)
| ~ lt(esk5_0,X17) )
& ( nil = esk4_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X18)
| ~ memberP(esk7_0,X18)
| ~ lt(X18,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_3])])])])]) ).
fof(c_0_5,plain,
! [X91] :
( ~ ssItem(X91)
| strictorderedP(cons(X91,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])]) ).
cnf(c_0_6,negated_conjecture,
~ strictorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
~ strictorderedP(esk3_0),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk3_0
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
esk3_0 = nil,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_13,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[ax69]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC288+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 01:56:39 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.2fS5lbaBxe/E---3.1_7846.p
% 0.50/300.10 # Version: 3.1pre001
% 0.50/300.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.50/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.50/300.10 # Starting sh5l with 300s (1) cores
% 0.50/300.10 # new_bool_1 with pid 7929 completed with status 0
% 0.50/300.10 # Result found by new_bool_1
% 0.50/300.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.50/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.50/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/300.10 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.50/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.50/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.50/300.10 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7932 completed with status 0
% 0.50/300.10 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.50/300.10 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.50/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.50/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/300.10 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.50/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.50/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.50/300.10 # Preprocessing time : 0.005 s
% 0.50/300.10 # Presaturation interreduction done
% 0.50/300.10
% 0.50/300.10 # Proof found!
% 0.50/300.10 # SZS status Theorem
% 0.50/300.10 # SZS output start CNFRefutation
% See solution above
% 0.50/300.10 # Parsed axioms : 96
% 0.50/300.10 # Removed by relevancy pruning/SinE : 52
% 0.50/300.10 # Initial clauses : 93
% 0.50/300.10 # Removed in clause preprocessing : 1
% 0.50/300.10 # Initial clauses in saturation : 92
% 0.50/300.10 # Processed clauses : 134
% 0.50/300.10 # ...of these trivial : 2
% 0.50/300.10 # ...subsumed : 4
% 0.50/300.10 # ...remaining for further processing : 128
% 0.50/300.10 # Other redundant clauses eliminated : 7
% 0.50/300.10 # Clauses deleted for lack of memory : 0
% 0.50/300.10 # Backward-subsumed : 0
% 0.50/300.10 # Backward-rewritten : 11
% 0.50/300.10 # Generated clauses : 14
% 0.50/300.10 # ...of the previous two non-redundant : 12
% 0.50/300.10 # ...aggressively subsumed : 0
% 0.50/300.10 # Contextual simplify-reflections : 2
% 0.50/300.10 # Paramodulations : 8
% 0.50/300.10 # Factorizations : 0
% 0.50/300.10 # NegExts : 0
% 0.50/300.10 # Equation resolutions : 7
% 0.50/300.10 # Total rewrite steps : 24
% 0.50/300.10 # Propositional unsat checks : 0
% 0.50/300.10 # Propositional check models : 0
% 0.50/300.10 # Propositional check unsatisfiable : 0
% 0.50/300.10 # Propositional clauses : 0
% 0.50/300.10 # Propositional clauses after purity: 0
% 0.50/300.10 # Propositional unsat core size : 0
% 0.50/300.10 # Propositional preprocessing time : 0.000
% 0.50/300.10 # Propositional encoding time : 0.000
% 0.50/300.10 # Propositional solver time : 0.000
% 0.50/300.10 # Success case prop preproc time : 0.000
% 0.50/300.10 # Success case prop encoding time : 0.000
% 0.50/300.10 # Success case prop solver time : 0.000
% 0.50/300.10 # Current number of processed clauses : 24
% 0.50/300.10 # Positive orientable unit clauses : 8
% 0.50/300.10 # Positive unorientable unit clauses: 0
% 0.50/300.10 # Negative unit clauses : 1
% 0.50/300.10 # Non-unit-clauses : 15
% 0.50/300.10 # Current number of unprocessed clauses: 55
% 0.50/300.10 # ...number of literals in the above : 229
% 0.50/300.10 # Current number of archived formulas : 0
% 0.50/300.10 # Current number of archived clauses : 98
% 0.50/300.10 # Clause-clause subsumption calls (NU) : 1011
% 0.50/300.10 # Rec. Clause-clause subsumption calls : 217
% 0.50/300.10 # Non-unit clause-clause subsumptions : 6
% 0.50/300.10 # Unit Clause-clause subsumption calls : 1
% 0.50/300.10 # Rewrite failures with RHS unbound : 0
% 0.50/300.10 # BW rewrite match attempts : 1
% 0.50/300.10 # BW rewrite match successes : 1
% 0.50/300.10 # Condensation attempts : 0
% 0.50/300.10 # Condensation successes : 0
% 0.50/300.10 # Termbank termtop insertions : 7388
% 0.50/300.10
% 0.50/300.10 # -------------------------------------------------
% 0.50/300.10 # User time : 0.012 s
% 0.50/300.10 # System time : 0.007 s
% 0.50/300.10 # Total time : 0.019 s
% 0.50/300.10 # Maximum resident set size: 2068 pages
% 0.50/300.10
% 0.50/300.10 # -------------------------------------------------
% 0.50/300.10 # User time : 0.015 s
% 0.50/300.10 # System time : 0.009 s
% 0.50/300.10 # Total time : 0.024 s
% 0.50/300.10 # Maximum resident set size: 1800 pages
% 0.50/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------