TSTP Solution File: SWC050+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC050+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:41:14 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 97 ( 8 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 121 ( 42 ~; 44 |; 25 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn; 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ rearsegP(X4,X6)
| ~ rearsegP(X3,X6) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3jF79S4ujl/E---3.1_2650.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ rearsegP(X4,X6)
| ~ rearsegP(X3,X6) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X11)
| ~ neq(X11,nil)
| ~ rearsegP(esk2_0,X11)
| ~ rearsegP(esk1_0,X11) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X11)
| ~ neq(X11,nil)
| ~ rearsegP(esk2_0,X11)
| ~ rearsegP(esk1_0,X11) )
& ( neq(esk2_0,nil)
| ssList(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk5_0) )
& ( neq(esk2_0,nil)
| neq(esk5_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) )
& ( neq(esk2_0,nil)
| rearsegP(esk4_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| rearsegP(esk4_0,esk5_0) )
& ( neq(esk2_0,nil)
| rearsegP(esk3_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| rearsegP(esk3_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,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk2_0,X1)
| ~ rearsegP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( rearsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( rearsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ssList(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( ~ rearsegP(esk1_0,X1)
| ~ rearsegP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).
cnf(c_0_13,negated_conjecture,
neq(esk5_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_5]),c_0_6])]) ).
cnf(c_0_14,negated_conjecture,
rearsegP(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_5]),c_0_6])]) ).
cnf(c_0_15,negated_conjecture,
rearsegP(esk2_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_5]),c_0_5]),c_0_6])]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_5]),c_0_6])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC050+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:56:54 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.3jF79S4ujl/E---3.1_2650.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 2730 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-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 2732 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 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-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.46 # Preprocessing time : 0.002 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 : 70
% 0.17/0.46 # Initial clauses : 55
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 55
% 0.17/0.46 # Processed clauses : 82
% 0.17/0.46 # ...of these trivial : 8
% 0.17/0.46 # ...subsumed : 0
% 0.17/0.46 # ...remaining for further processing : 74
% 0.17/0.46 # Other redundant clauses eliminated : 6
% 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 : 7
% 0.17/0.46 # ...of the previous two non-redundant : 5
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 1
% 0.17/0.46 # Paramodulations : 2
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 6
% 0.17/0.46 # Total rewrite steps : 34
% 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 : 22
% 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 : 1
% 0.17/0.46 # Non-unit-clauses : 7
% 0.17/0.46 # Current number of unprocessed clauses: 25
% 0.17/0.46 # ...number of literals in the above : 97
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 47
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 127
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 41
% 0.17/0.46 # Non-unit clause-clause subsumptions : 1
% 0.17/0.46 # Unit Clause-clause subsumption calls : 0
% 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 : 4525
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.006 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.008 s
% 0.17/0.46 # Maximum resident set size: 1916 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.008 s
% 0.17/0.46 # System time : 0.005 s
% 0.17/0.46 # Total time : 0.013 s
% 0.17/0.46 # Maximum resident set size: 1800 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------