TSTP Solution File: CSR023+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR023+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:31:14 EDT 2024
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 291 ( 163 equ)
% Maximal formula atoms : 120 ( 9 avg)
% Number of connectives : 365 ( 104 ~; 190 |; 66 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(happens_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& initiates(X4,X2,X5) )
=> holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/tmp/tmp.ktbTBNbt2K/E---3.1_29979.p',happens_holds) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox2/tmp/tmp.ktbTBNbt2K/E---3.1_29979.p',symmetry_of_plus) ).
fof(initiates_all_defn,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = forwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = backwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = spinning
& happens(push,X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ktbTBNbt2K/E---3.1_29979.p',initiates_all_defn) ).
fof(plus1_2,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/tmp/tmp.ktbTBNbt2K/E---3.1_29979.p',plus1_2) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = push
& X5 = n0 )
| ( X4 = pull
& X5 = n1 )
| ( X4 = pull
& X5 = n2 )
| ( X4 = push
& X5 = n2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ktbTBNbt2K/E---3.1_29979.p',happens_all_defn) ).
fof(spinning_3,conjecture,
holdsAt(spinning,n3),
file('/export/starexec/sandbox2/tmp/tmp.ktbTBNbt2K/E---3.1_29979.p',spinning_3) ).
fof(c_0_6,plain,
! [X19,X20,X21] :
( ~ happens(X19,X20)
| ~ initiates(X19,X21,X20)
| holdsAt(X21,plus(X20,n1)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_holds])])]) ).
fof(c_0_7,plain,
! [X40,X41] : plus(X40,X41) = plus(X41,X40),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_8,plain,
! [X2,X4,X5] :
( epred1_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = forwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = backwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = spinning
& happens(push,X5) ) ) ),
introduced(definition) ).
cnf(c_0_9,plain,
( holdsAt(X3,plus(X2,n1))
| ~ happens(X1,X2)
| ~ initiates(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[initiates_all_defn]),c_0_8]) ).
cnf(c_0_12,plain,
( holdsAt(X1,plus(n1,X2))
| ~ initiates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
fof(c_0_14,plain,
! [X27,X28,X29] :
( ( ~ initiates(X27,X28,X29)
| epred1_3(X29,X27,X28) )
& ( ~ epred1_3(X29,X27,X28)
| initiates(X27,X28,X29) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_15,plain,
! [X49,X50,X51] :
( ( X50 = pull
| X50 = pull
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X50 = pull
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X50 = pull
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X49 = backwards
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X49 = backwards
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X49 = backwards
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| ~ happens(push,X51)
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| ~ happens(push,X51)
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| ~ happens(push,X51)
| X50 = push
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X50 = pull
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X50 = pull
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X50 = pull
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X49 = backwards
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X49 = backwards
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X49 = backwards
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| ~ happens(push,X51)
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| ~ happens(push,X51)
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| ~ happens(push,X51)
| X49 = forwards
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X50 = pull
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X50 = pull
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X50 = pull
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| X49 = backwards
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| X49 = backwards
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| X49 = backwards
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X50 = pull
| ~ happens(push,X51)
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X49 = spinning
| ~ happens(push,X51)
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( happens(push,X51)
| ~ happens(push,X51)
| ~ happens(pull,X51)
| ~ epred1_3(X51,X50,X49) )
& ( X50 != push
| X49 != forwards
| happens(pull,X51)
| epred1_3(X51,X50,X49) )
& ( X50 != pull
| X49 != backwards
| happens(push,X51)
| epred1_3(X51,X50,X49) )
& ( X50 != pull
| X49 != spinning
| ~ happens(push,X51)
| epred1_3(X51,X50,X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_16,plain,
! [X47,X48] :
( ( X47 = push
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 != push
| X48 != n0
| happens(X47,X48) )
& ( X47 != pull
| X48 != n1
| happens(X47,X48) )
& ( X47 != pull
| X48 != n2
| happens(X47,X48) )
& ( X47 != push
| X48 != n2
| happens(X47,X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).
fof(c_0_17,negated_conjecture,
~ holdsAt(spinning,n3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[spinning_3])]) ).
cnf(c_0_18,plain,
( holdsAt(X1,n3)
| ~ initiates(X2,X1,n2)
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( initiates(X2,X3,X1)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( epred1_3(X3,X1,X2)
| X1 != pull
| X2 != spinning
| ~ happens(push,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( happens(X1,X2)
| X1 != pull
| X2 != n2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( happens(X1,X2)
| X1 != push
| X2 != n2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,negated_conjecture,
~ holdsAt(spinning,n3),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( holdsAt(X1,n3)
| ~ epred1_3(n2,X2,X1)
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( epred1_3(X1,pull,spinning)
| ~ happens(push,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]) ).
cnf(c_0_26,plain,
happens(pull,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).
cnf(c_0_27,plain,
happens(push,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
~ holdsAt(spinning,n3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : CSR023+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n017.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 14:22:52 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ktbTBNbt2K/E---3.1_29979.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 30058 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.16/0.45 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 30062 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.16/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.002 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 48
% 0.16/0.45 # Removed by relevancy pruning/SinE : 17
% 0.16/0.45 # Initial clauses : 154
% 0.16/0.45 # Removed in clause preprocessing : 9
% 0.16/0.45 # Initial clauses in saturation : 145
% 0.16/0.45 # Processed clauses : 432
% 0.16/0.45 # ...of these trivial : 3
% 0.16/0.45 # ...subsumed : 145
% 0.16/0.45 # ...remaining for further processing : 284
% 0.16/0.45 # Other redundant clauses eliminated : 54
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 14
% 0.16/0.45 # Backward-rewritten : 7
% 0.16/0.45 # Generated clauses : 362
% 0.16/0.45 # ...of the previous two non-redundant : 247
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 4
% 0.16/0.45 # Paramodulations : 253
% 0.16/0.45 # Factorizations : 66
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 54
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 141
% 0.16/0.45 # ...of those cached : 117
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 165
% 0.16/0.45 # Positive orientable unit clauses : 21
% 0.16/0.45 # Positive unorientable unit clauses: 1
% 0.16/0.45 # Negative unit clauses : 21
% 0.16/0.45 # Non-unit-clauses : 122
% 0.16/0.45 # Current number of unprocessed clauses: 20
% 0.16/0.45 # ...number of literals in the above : 63
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 104
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 1877
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 1209
% 0.16/0.45 # Non-unit clause-clause subsumptions : 110
% 0.16/0.45 # Unit Clause-clause subsumption calls : 284
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 28
% 0.16/0.45 # BW rewrite match successes : 27
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 10966
% 0.16/0.45 # Search garbage collected termcells : 1355
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.019 s
% 0.16/0.45 # System time : 0.006 s
% 0.16/0.45 # Total time : 0.025 s
% 0.16/0.45 # Maximum resident set size: 2112 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.020 s
% 0.16/0.45 # System time : 0.008 s
% 0.16/0.45 # Total time : 0.028 s
% 0.16/0.45 # Maximum resident set size: 1748 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------