%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : COM007+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:14:42 AM UTC 2026
% Result : Theorem 30.38s 35.99s
% Output : Proof 30.38s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(assumption,axiom,
( reflexive_rewrite(a,c)
& reflexive_rewrite(a,b) ),
file('theBenchmark.p',assumption) ).
fof(goal_ax,axiom,
! [A] :
( ( reflexive_rewrite(c,A)
& reflexive_rewrite(b,A) )
=> goal ),
file('theBenchmark.p',goal_ax) ).
fof(reflexivity,axiom,
! [A] : equalish(A,A),
file('theBenchmark.p',reflexivity) ).
fof(symmtery,axiom,
! [A,B] :
( equalish(A,B)
=> equalish(B,A) ),
file('theBenchmark.p',symmtery) ).
fof(substitution,axiom,
! [A,B,C] :
( ( reflexive_rewrite(B,C)
& equalish(A,B) )
=> reflexive_rewrite(A,C) ),
file('theBenchmark.p',substitution) ).
fof(equalish_in_reflexive_rewrite,axiom,
! [A,B] :
( equalish(A,B)
=> reflexive_rewrite(A,B) ),
file('theBenchmark.p',equalish_in_reflexive_rewrite) ).
fof(rewrite_in_reflexive_rewrite,axiom,
! [A,B] :
( rewrite(A,B)
=> reflexive_rewrite(A,B) ),
file('theBenchmark.p',rewrite_in_reflexive_rewrite) ).
fof(equalish_or_rewrite,axiom,
! [A,B] :
( reflexive_rewrite(A,B)
=> ( rewrite(A,B)
| equalish(A,B) ) ),
file('theBenchmark.p',equalish_or_rewrite) ).
fof(rewrite_diamond,axiom,
! [A,B,C] :
( ( rewrite(A,C)
& rewrite(A,B) )
=> ? [D] :
( rewrite(C,D)
& rewrite(B,D) ) ),
file('theBenchmark.p',rewrite_diamond) ).
fof(goal_to_be_proved,conjecture,
goal,
file('theBenchmark.p',goal_to_be_proved) ).
fof(f_1_1,plain,
( reflexive_rewrite(a,c)
& reflexive_rewrite(a,b) ),
inference(fof_nnf,[status(thm)],[assumption]) ).
fof(f_1_2,plain,
( reflexive_rewrite(a,c)
& reflexive_rewrite(a,b) ),
inference(definitional_conversion,[status(esa)],[f_1_1]) ).
cnf(f_1_3,plain,
reflexive_rewrite(a,b),
inference(clausify,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
reflexive_rewrite(a,c),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [A] :
( goal
| ~ reflexive_rewrite(c,A)
| ~ reflexive_rewrite(b,A) ),
inference(fof_nnf,[status(thm)],[goal_ax]) ).
fof(f_2_2,plain,
! [U_0] :
( goal
| ~ reflexive_rewrite(c,U_0)
| ~ reflexive_rewrite(b,U_0) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_0] :
( ~ reflexive_rewrite(c,U_0)
| ~ reflexive_rewrite(b,U_0) )
| goal ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
! [U_0] :
( ~ reflexive_rewrite(c,U_0)
| ~ reflexive_rewrite(b,U_0)
| goal ),
inference(definitional_conversion,[status(esa)],[f_2_3]) ).
cnf(f_2_5,plain,
( ~ reflexive_rewrite(c,U_0)
| ~ reflexive_rewrite(b,U_0)
| goal ),
inference(clausify,[status(thm)],[f_2_4]) ).
fof(f_3_1,plain,
! [A] : equalish(A,A),
inference(fof_nnf,[status(thm)],[reflexivity]) ).
fof(f_3_2,plain,
! [U_1] : equalish(U_1,U_1),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
! [U_1] : equalish(U_1,U_1),
inference(definitional_conversion,[status(esa)],[f_3_2]) ).
cnf(f_3_4,plain,
equalish(U_1,U_1),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [A,B] :
( equalish(B,A)
| ~ equalish(A,B) ),
inference(fof_nnf,[status(thm)],[symmtery]) ).
fof(f_4_2,plain,
! [U_3,U_2] :
( equalish(U_2,U_3)
| ~ equalish(U_3,U_2) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_2,U_3] :
( equalish(U_2,U_3)
| ~ equalish(U_3,U_2) ),
inference(definitional_conversion,[status(esa)],[f_4_2]) ).
cnf(f_4_4,plain,
( equalish(U_2,U_3)
| ~ equalish(U_3,U_2) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
! [A,B,C] :
( reflexive_rewrite(A,C)
| ~ reflexive_rewrite(B,C)
| ~ equalish(A,B) ),
inference(fof_nnf,[status(thm)],[substitution]) ).
fof(f_5_2,plain,
! [U_6,U_5,U_4] :
( reflexive_rewrite(U_6,U_4)
| ~ reflexive_rewrite(U_5,U_4)
| ~ equalish(U_6,U_5) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
! [U_4,U_5,U_6] :
( reflexive_rewrite(U_6,U_4)
| ~ reflexive_rewrite(U_5,U_4)
| ~ equalish(U_6,U_5) ),
inference(definitional_conversion,[status(esa)],[f_5_2]) ).
cnf(f_5_4,plain,
( reflexive_rewrite(U_6,U_4)
| ~ reflexive_rewrite(U_5,U_4)
| ~ equalish(U_6,U_5) ),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
! [A,B] :
( reflexive_rewrite(A,B)
| ~ equalish(A,B) ),
inference(fof_nnf,[status(thm)],[equalish_in_reflexive_rewrite]) ).
fof(f_6_2,plain,
! [U_8,U_7] :
( reflexive_rewrite(U_8,U_7)
| ~ equalish(U_8,U_7) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
! [U_7,U_8] :
( reflexive_rewrite(U_8,U_7)
| ~ equalish(U_8,U_7) ),
inference(definitional_conversion,[status(esa)],[f_6_2]) ).
cnf(f_6_4,plain,
( reflexive_rewrite(U_8,U_7)
| ~ equalish(U_8,U_7) ),
inference(clausify,[status(thm)],[f_6_3]) ).
fof(f_7_1,plain,
! [A,B] :
( reflexive_rewrite(A,B)
| ~ rewrite(A,B) ),
inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite]) ).
fof(f_7_2,plain,
! [U_10,U_9] :
( reflexive_rewrite(U_10,U_9)
| ~ rewrite(U_10,U_9) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
! [U_9,U_10] :
( reflexive_rewrite(U_10,U_9)
| ~ rewrite(U_10,U_9) ),
inference(definitional_conversion,[status(esa)],[f_7_2]) ).
cnf(f_7_4,plain,
( reflexive_rewrite(U_10,U_9)
| ~ rewrite(U_10,U_9) ),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,plain,
! [A,B] :
( rewrite(A,B)
| equalish(A,B)
| ~ reflexive_rewrite(A,B) ),
inference(fof_nnf,[status(thm)],[equalish_or_rewrite]) ).
fof(f_8_2,plain,
! [U_12,U_11] :
( rewrite(U_12,U_11)
| equalish(U_12,U_11)
| ~ reflexive_rewrite(U_12,U_11) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
! [U_12,U_11] :
( rewrite(U_12,U_11)
| equalish(U_12,U_11)
| ~ reflexive_rewrite(U_12,U_11) ),
inference(definitional_conversion,[status(esa)],[f_8_2]) ).
cnf(f_8_4,plain,
( rewrite(U_12,U_11)
| equalish(U_12,U_11)
| ~ reflexive_rewrite(U_12,U_11) ),
inference(clausify,[status(thm)],[f_8_3]) ).
fof(f_9_1,plain,
! [A,B,C] :
( ? [D] :
( rewrite(C,D)
& rewrite(B,D) )
| ~ rewrite(A,C)
| ~ rewrite(A,B) ),
inference(fof_nnf,[status(thm)],[rewrite_diamond]) ).
fof(f_9_2,plain,
! [U_16,U_15,U_14] :
( ? [U_13] :
( rewrite(U_14,U_13)
& rewrite(U_15,U_13) )
| ~ rewrite(U_16,U_14)
| ~ rewrite(U_16,U_15) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
fof(f_9_3,plain,
! [U_16,U_15,U_14] :
( ( rewrite(U_14,sK1(U_16,U_15,U_14))
& rewrite(U_15,sK1(U_16,U_15,U_14)) )
| ~ rewrite(U_16,U_14)
| ~ rewrite(U_16,U_15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_13,sK1(U_16,U_15,U_14))],[f_9_2]) ).
fof(f_9_4,plain,
( ! [U_15,U_14,U_16] :
( rewrite(U_14,sK1(U_16,U_15,U_14))
| ~ sP0(U_15,U_14,U_16) )
& ! [U_15,U_14,U_16] :
( rewrite(U_15,sK1(U_16,U_15,U_14))
| ~ sP0(U_15,U_14,U_16) )
& ! [U_15,U_14,U_16] :
( sP0(U_15,U_14,U_16)
| ~ rewrite(U_16,U_14)
| ~ rewrite(U_16,U_15) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_9_3]) ).
cnf(f_9_5,plain,
( sP0(U_15,U_14,U_16)
| ~ rewrite(U_16,U_14)
| ~ rewrite(U_16,U_15) ),
inference(clausify,[status(thm)],[f_9_4]) ).
cnf(f_9_6,plain,
( rewrite(U_15,sK1(U_16,U_15,U_14))
| ~ sP0(U_15,U_14,U_16) ),
inference(clausify,[status(thm)],[f_9_4]) ).
cnf(f_9_7,plain,
( rewrite(U_14,sK1(U_16,U_15,U_14))
| ~ sP0(U_15,U_14,U_16) ),
inference(clausify,[status(thm)],[f_9_4]) ).
fof(f_10_1,negated_conjecture,
~ goal,
inference(negate,[status(cth)],[goal_to_be_proved]) ).
fof(f_10_2,negated_conjecture,
~ goal,
inference(definitional_conversion,[status(esa)],[f_10_1]) ).
cnf(f_10_3,negated_conjecture,
~ goal,
inference(clausify,[status(thm)],[f_10_2]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM007+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.61 % Computer : n003.cluster.edu
% 0.11/5.61 % Model : x86_64 x86_64
% 0.11/5.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.61 % Memory : 8046.5625MB
% 0.11/5.61 % OS : Linux 6.8.0-71-generic
% 0.11/5.61 % CPULimit : 300
% 0.11/5.61 % WCLimit : 300
% 0.11/5.61 % DateTime : Sun Sep 20 15:10:20 UTC 2026
% 0.11/5.61 % CPUTime :
% 30.38/35.99 % SZS status Theorem for theBenchmark
% 30.38/35.99 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------