%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : CSR098+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:35:37 AM UTC 2026
% Result : Theorem 74.36s 74.60s
% Output : Proof 74.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 25 unt; 0 def)
% Number of atoms : 33 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 10 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_1002,axiom,
! [V__INST] : V__INST = V__INST,
file('CSR003+0.ax',kb_SUMO_1002) ).
fof(local_1,axiom,
s__instance(s__Frog29_1,s__Amphibian),
file('theBenchmark.p',local_1) ).
fof(local_3,axiom,
s__Frog29_1 = s__Animal29_1,
file('theBenchmark.p',local_3) ).
fof(prove_from_SUMO,conjecture,
s__instance(s__Animal29_1,s__Amphibian),
file('theBenchmark.p',prove_from_SUMO) ).
fof(f_999_1,plain,
! [V__INST] : V__INST = V__INST,
inference(fof_nnf,[status(thm)],[kb_SUMO_1002]) ).
fof(f_999_2,plain,
! [U_2050] : U_2050 = U_2050,
inference(variable_rename,[status(thm)],[f_999_1]) ).
fof(f_999_3,plain,
! [U_2050] : U_2050 = U_2050,
inference(definitional_conversion,[status(esa)],[f_999_2]) ).
cnf(f_999_4,plain,
U_2050 = U_2050,
inference(clausify,[status(thm)],[f_999_3]) ).
fof(f_14788_1,plain,
s__instance(s__Frog29_1,s__Amphibian),
inference(fof_nnf,[status(thm)],[local_1]) ).
fof(f_14788_2,plain,
s__instance(s__Frog29_1,s__Amphibian),
inference(definitional_conversion,[status(esa)],[f_14788_1]) ).
cnf(f_14788_3,plain,
s__instance(s__Frog29_1,s__Amphibian),
inference(clausify,[status(thm)],[f_14788_2]) ).
fof(f_14790_1,plain,
s__Frog29_1 = s__Animal29_1,
inference(fof_nnf,[status(thm)],[local_3]) ).
fof(f_14790_2,plain,
s__Frog29_1 = s__Animal29_1,
inference(definitional_conversion,[status(esa)],[f_14790_1]) ).
cnf(f_14790_3,plain,
s__Frog29_1 = s__Animal29_1,
inference(clausify,[status(thm)],[f_14790_2]) ).
fof(f_14791_1,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(negate,[status(cth)],[prove_from_SUMO]) ).
fof(f_14791_2,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(definitional_conversion,[status(esa)],[f_14791_1]) ).
cnf(f_14791_3,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(clausify,[status(thm)],[f_14791_2]) ).
cnf(equality_625,axiom,
( s__instance(Eq_y_0,Eq_y_1)
| ~ s__instance(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(start,[status(thm),parent(0:0)],[f_14791_3]) ).
cnf(t2,plain,
( s__Amphibian != s__Amphibian
| ~ s__instance(s__Frog29_1,s__Amphibian)
| s__Frog29_1 != s__Animal29_1
| s__instance(s__Animal29_1,s__Amphibian) ),
inference(extension,[status(thm),parent(t1:1)],[equality_625]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
s__Frog29_1 = s__Animal29_1,
inference(extension,[status(thm),parent(t2:2)],[f_14790_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
s__instance(s__Frog29_1,s__Amphibian),
inference(extension,[status(thm),parent(t2:3)],[f_14788_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
s__Amphibian = s__Amphibian,
inference(extension,[status(thm),parent(t2:4)],[f_999_4]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CSR098+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.01 This is a FOF_CAX_RFO_SEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sun Sep 20 16:47:37 UTC 2026
% 0.03/0.30 % CPUTime :
% 74.36/74.60 % SZS status Theorem for theBenchmark
% 74.36/74.60 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------