TSTP Solution File: COM007+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COM007+2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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:36:15 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 43 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 77 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 34 ~; 31 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn; 20 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
a: $i ).
tff(decl_23,type,
b: $i ).
tff(decl_24,type,
reflexive_rewrite: ( $i * $i ) > $o ).
tff(decl_25,type,
c: $i ).
tff(decl_26,type,
goal: $o ).
tff(decl_27,type,
rewrite: ( $i * $i ) > $o ).
tff(decl_28,type,
esk1_3: ( $i * $i * $i ) > $i ).
fof(goal_ax,axiom,
! [X1] :
( ( reflexive_rewrite(b,X1)
& reflexive_rewrite(c,X1) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_ax) ).
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(rewrite_in_reflexive_rewrite,axiom,
! [X1,X2] :
( rewrite(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_in_reflexive_rewrite) ).
fof(rewrite_diamond,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X2)
& rewrite(X1,X3) )
=> ? [X4] :
( rewrite(X2,X4)
& rewrite(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_diamond) ).
fof(equal_or_rewrite,axiom,
! [X1,X2] :
( reflexive_rewrite(X1,X2)
=> ( X1 = X2
| rewrite(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_or_rewrite) ).
fof(equal_in_reflexive_rewrite,axiom,
! [X1,X2] :
( X1 = X2
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_in_reflexive_rewrite) ).
fof(assumption,axiom,
( reflexive_rewrite(a,b)
& reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption) ).
fof(c_0_7,plain,
! [X5] :
( ~ reflexive_rewrite(b,X5)
| ~ reflexive_rewrite(c,X5)
| goal ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[goal_ax])]) ).
fof(c_0_8,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).
cnf(c_0_9,plain,
( goal
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X8,X9] :
( ~ rewrite(X8,X9)
| reflexive_rewrite(X8,X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite])]) ).
cnf(c_0_12,plain,
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( ~ rewrite(c,X1)
| ~ reflexive_rewrite(b,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_15,plain,
! [X12,X13,X14] :
( ( rewrite(X13,esk1_3(X12,X13,X14))
| ~ rewrite(X12,X13)
| ~ rewrite(X12,X14) )
& ( rewrite(X14,esk1_3(X12,X13,X14))
| ~ rewrite(X12,X13)
| ~ rewrite(X12,X14) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_diamond])])])]) ).
cnf(c_0_16,plain,
( ~ rewrite(c,X1)
| ~ rewrite(b,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
( rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X10,X11] :
( ~ reflexive_rewrite(X10,X11)
| X10 = X11
| rewrite(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_or_rewrite])]) ).
fof(c_0_19,plain,
! [X6,X7] :
( X6 != X7
| reflexive_rewrite(X6,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_in_reflexive_rewrite])]) ).
cnf(c_0_20,plain,
( ~ rewrite(b,esk1_3(X1,X2,c))
| ~ rewrite(X1,c)
| ~ rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( X1 = X2
| rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_24,plain,
( reflexive_rewrite(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( c = a
| rewrite(a,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_28,plain,
reflexive_rewrite(X1,X1),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( c = a
| ~ rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( a = b
| rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_31,plain,
~ rewrite(c,b),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_32,plain,
( a = b
| c = a ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
a = b,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30]) ).
cnf(c_0_34,plain,
~ reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_12,c_0_28]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : COM007+2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 13:30:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.006000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.009000 s
%------------------------------------------------------------------------------