TSTP Solution File: CSR017+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : CSR017+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n025.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 : Wed Aug 30 18:53:19 EDT 2023
% Result : Theorem 0.23s 0.67s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 52
% Syntax : Number of formulae : 95 ( 20 unt; 39 typ; 0 def)
% Number of atoms : 419 ( 207 equ)
% Maximal formula atoms : 149 ( 7 avg)
% Number of connectives : 498 ( 135 ~; 250 |; 100 &)
% ( 11 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 64 ( 24 >; 40 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-4 aty)
% Number of functors : 24 ( 24 usr; 15 con; 0-3 aty)
% Number of variables : 82 ( 0 sgn; 52 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
stoppedIn: ( $i * $i * $i ) > $o ).
tff(decl_23,type,
happens: ( $i * $i ) > $o ).
tff(decl_24,type,
less: ( $i * $i ) > $o ).
tff(decl_25,type,
terminates: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
startedIn: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
initiates: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
n0: $i ).
tff(decl_29,type,
trajectory: ( $i * $i * $i * $i ) > $o ).
tff(decl_30,type,
plus: ( $i * $i ) > $i ).
tff(decl_31,type,
holdsAt: ( $i * $i ) > $o ).
tff(decl_32,type,
antitrajectory: ( $i * $i * $i * $i ) > $o ).
tff(decl_33,type,
n1: $i ).
tff(decl_34,type,
releasedAt: ( $i * $i ) > $o ).
tff(decl_35,type,
releases: ( $i * $i * $i ) > $o ).
tff(decl_36,type,
push: $i ).
tff(decl_37,type,
forwards: $i ).
tff(decl_38,type,
pull: $i ).
tff(decl_39,type,
backwards: $i ).
tff(decl_40,type,
spinning: $i ).
tff(decl_41,type,
n2: $i ).
tff(decl_42,type,
n3: $i ).
tff(decl_43,type,
n4: $i ).
tff(decl_44,type,
n5: $i ).
tff(decl_45,type,
n6: $i ).
tff(decl_46,type,
less_or_equal: ( $i * $i ) > $o ).
tff(decl_47,type,
n7: $i ).
tff(decl_48,type,
n8: $i ).
tff(decl_49,type,
n9: $i ).
tff(decl_50,type,
epred1_3: ( $i * $i * $i ) > $o ).
tff(decl_51,type,
epred2_3: ( $i * $i * $i ) > $o ).
tff(decl_52,type,
epred3_3: ( $i * $i * $i ) > $o ).
tff(decl_53,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_57,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk8_2: ( $i * $i ) > $i ).
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(happens_terminates_not_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
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/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(less_or_equal,axiom,
! [X9,X10] :
( less_or_equal(X9,X10)
<=> ( less(X9,X10)
| X9 = X10 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
fof(not_spinning_1,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_spinning_1) ).
fof(less_property,axiom,
! [X9,X10] :
( less(X9,X10)
<=> ( ~ less(X10,X9)
& X10 != X9 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
fof(less2,axiom,
! [X9] :
( less(X9,n2)
<=> less_or_equal(X9,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
fof(less1,axiom,
! [X9] :
( less(X9,n1)
<=> less_or_equal(X9,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).
fof(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(c_0_11,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_12,plain,
! [X2,X4,X5] :
( epred2_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_13,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( epred2_3(X5,X4,X2)
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
inference(apply_def,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]),c_0_11]) ).
fof(c_0_15,plain,
! [X100,X101,X102] :
( ( X101 = pull
| X101 = push
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X101 = push
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X101 = push
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X100 = spinning
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X100 = spinning
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X100 = spinning
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| ~ happens(pull,X102)
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| ~ happens(pull,X102)
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| ~ happens(pull,X102)
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X101 = push
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X101 = push
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X101 = push
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X100 = spinning
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X100 = spinning
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X100 = spinning
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| ~ happens(pull,X102)
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| ~ happens(pull,X102)
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| ~ happens(pull,X102)
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X101 = push
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X101 = push
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X101 = push
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X100 = spinning
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X100 = spinning
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X100 = spinning
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| ~ happens(pull,X102)
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| ~ happens(pull,X102)
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| ~ happens(pull,X102)
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ epred2_3(X102,X101,X100)
| epred3_3(X102,X101,X100) )
& ( X101 != pull
| X100 != backwards
| ~ happens(push,X102)
| epred3_3(X102,X101,X100) )
& ( X101 != push
| X100 != spinning
| happens(pull,X102)
| epred3_3(X102,X101,X100) )
& ( X101 != pull
| X100 != spinning
| happens(push,X102)
| epred3_3(X102,X101,X100) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,plain,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[happens_terminates_not_holds]) ).
fof(c_0_17,plain,
! [X68,X69,X70] :
( ( ~ terminates(X68,X69,X70)
| epred3_3(X70,X68,X69) )
& ( ~ epred3_3(X70,X68,X69)
| terminates(X68,X69,X70) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_18,plain,
( happens(pull,X3)
| epred3_3(X3,X1,X2)
| X1 != push
| X2 != spinning ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X56,X57,X58] :
( ~ happens(X56,X57)
| ~ terminates(X56,X58,X57)
| ~ holdsAt(X58,plus(X57,n1)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
cnf(c_0_20,plain,
( terminates(X2,X3,X1)
| ~ epred3_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( epred3_3(X1,push,spinning)
| happens(pull,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]) ).
fof(c_0_22,plain,
! [X74,X75] :
( ( X74 = push
| X74 = pull
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X74 = pull
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X74 = pull
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 = push
| X74 = pull
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 != push
| X75 != n0
| happens(X74,X75) )
& ( X74 != pull
| X75 != n1
| happens(X74,X75) )
& ( X74 != pull
| X75 != n2
| happens(X74,X75) )
& ( X74 != push
| X75 != n2
| happens(X74,X75) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])]) ).
fof(c_0_23,plain,
! [X76,X77] : plus(X76,X77) = plus(X77,X76),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_24,plain,
! [X78,X79] :
( ( ~ less_or_equal(X78,X79)
| less(X78,X79)
| X78 = X79 )
& ( ~ less(X78,X79)
| less_or_equal(X78,X79) )
& ( X78 != X79
| less_or_equal(X78,X79) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])]) ).
cnf(c_0_25,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( terminates(push,spinning,X1)
| happens(pull,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( happens(X1,X2)
| X1 != push
| X2 != n0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
cnf(c_0_29,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,negated_conjecture,
holdsAt(spinning,n1),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_spinning_1])]) ).
fof(c_0_31,plain,
! [X9,X10] :
( less(X9,X10)
<=> ( ~ less(X10,X9)
& X10 != X9 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_32,plain,
! [X82] :
( ( ~ less(X82,n2)
| less_or_equal(X82,n1) )
& ( ~ less_or_equal(X82,n1)
| less(X82,n2) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])]) ).
cnf(c_0_33,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_34,plain,
! [X81] :
( ( ~ less(X81,n1)
| less_or_equal(X81,n0) )
& ( ~ less_or_equal(X81,n0)
| less(X81,n1) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])]) ).
cnf(c_0_35,plain,
( X1 = push
| X2 = n2
| X2 = n1
| X1 = push
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,plain,
( happens(pull,X1)
| ~ holdsAt(spinning,plus(X1,n1))
| ~ happens(push,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_37,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])]) ).
cnf(c_0_38,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
holdsAt(spinning,n1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_40,plain,
! [X90,X91] :
( ( ~ less(X91,X90)
| ~ less(X90,X91) )
& ( X91 != X90
| ~ less(X90,X91) )
& ( less(X91,X90)
| X91 = X90
| less(X90,X91) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
cnf(c_0_41,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( X2 = n1
| X2 = n2
| X1 = push
| ~ happens(X1,X2) ),
inference(cn,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
happens(pull,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_29]),c_0_38]),c_0_39])]) ).
cnf(c_0_46,plain,
push != pull,
inference(split_conjunct,[status(thm)],[push_not_pull]) ).
cnf(c_0_47,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_50,plain,
( n0 = n2
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( X1 != X2
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_53,plain,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_55,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_53]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : CSR017+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.00/0.16 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.38 % Computer : n025.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Aug 28 08:41:54 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.62 start to proof: theBenchmark
% 0.23/0.67 % Version : CSE_E---1.5
% 0.23/0.67 % Problem : theBenchmark.p
% 0.23/0.67 % Proof found
% 0.23/0.67 % SZS status Theorem for theBenchmark.p
% 0.23/0.67 % SZS output start Proof
% See solution above
% 0.23/0.68 % Total time : 0.033000 s
% 0.23/0.68 % SZS output end Proof
% 0.23/0.68 % Total time : 0.037000 s
%------------------------------------------------------------------------------