%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYO561+1 : TPTP v9.3.1. Released v5.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 : n008.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 09:12:05 AM UTC 2026
% Result : Theorem 0.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 9 unt; 0 def)
% Number of atoms : 13 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 0 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apple_not_microsoft,conjecture,
"Apple" != "Microsoft",
file('theBenchmark.p',apple_not_microsoft) ).
fof(f_1_1,negated_conjecture,
"Apple" = "Microsoft",
inference(negate,[status(cth)],[apple_not_microsoft]) ).
fof(f_1_2,negated_conjecture,
"Apple" = "Microsoft",
inference(definitional_conversion,[status(esa)],[f_1_1]) ).
cnf(f_1_3,negated_conjecture,
"Apple" = "Microsoft",
inference(clausify,[status(thm)],[f_1_2]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(distinct_objects_1,axiom,
"Microsoft" != "Apple",
theory(distinct_objects,[distinct_objects]) ).
cnf(t1,plain,
"Microsoft" != "Apple",
inference(start,[status(thm),parent(0:0)],[distinct_objects_1]) ).
cnf(t2,plain,
( "Apple" != "Microsoft"
| "Microsoft" = "Apple" ),
inference(extension,[status(thm),parent(t1:1)],[equality_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
"Apple" = "Microsoft",
inference(extension,[status(thm),parent(t2:2)],[f_1_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO561+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.02 This is a FOF_THM_EPR_PEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 07:42:23 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------