TSTP Solution File: SWC333+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC333+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:38 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 105 ( 8 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 135 ( 52 ~; 48 |; 25 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 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
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.WjF014u83T/E---3.1_2113.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
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
& segmentP(esk4_0,esk3_0)
& totalorderedP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(esk3_0,X11)
| ~ segmentP(esk4_0,X11)
| ~ segmentP(X11,esk3_0)
| ~ totalorderedP(X11) )
& ( ssList(esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( neq(esk1_0,esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( segmentP(esk2_0,esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( segmentP(esk5_0,esk1_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( totalorderedP(esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_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,
totalorderedP(esk3_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,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(X1,esk3_0)
| ~ totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( neq(esk1_0,esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
totalorderedP(esk1_0),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_10,negated_conjecture,
segmentP(esk2_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( totalorderedP(esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( segmentP(esk5_0,esk1_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( segmentP(esk2_0,esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( ssList(esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk1_0)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(esk1_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_4]),c_0_4]),c_0_6]) ).
cnf(c_0_16,negated_conjecture,
neq(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_17,negated_conjecture,
totalorderedP(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_10])]) ).
cnf(c_0_18,negated_conjecture,
segmentP(esk5_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_9]),c_0_10])]) ).
cnf(c_0_19,negated_conjecture,
segmentP(esk2_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9]),c_0_10])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC333+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n012.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:37:50 EDT 2023
% 0.14/0.35 % 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.WjF014u83T/E---3.1_2113.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_3 with pid 2193 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 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 # 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 2198 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 # 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.003 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 : 47
% 0.20/0.51 # Initial clauses : 90
% 0.20/0.51 # Removed in clause preprocessing : 1
% 0.20/0.51 # Initial clauses in saturation : 89
% 0.20/0.51 # Processed clauses : 123
% 0.20/0.51 # ...of these trivial : 2
% 0.20/0.51 # ...subsumed : 3
% 0.20/0.51 # ...remaining for further processing : 118
% 0.20/0.51 # Other redundant clauses eliminated : 9
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 9
% 0.20/0.51 # ...of the previous two non-redundant : 8
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 1
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 9
% 0.20/0.51 # Total rewrite steps : 27
% 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 : 26
% 0.20/0.51 # Positive orientable unit clauses : 16
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 9
% 0.20/0.51 # Current number of unprocessed clauses: 58
% 0.20/0.51 # ...number of literals in the above : 231
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 84
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 1185
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 242
% 0.20/0.51 # Non-unit clause-clause subsumptions : 3
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 7349
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.015 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.017 s
% 0.20/0.51 # Maximum resident set size: 2088 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.019 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.022 s
% 0.20/0.51 # Maximum resident set size: 1800 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------