%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : NUM002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n026.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 : Fri Sep 25 02:18:30 PM UTC 2026
% Result : Unsatisfiable 7.30s 1.46s
% Output : Proof 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 29 unt; 0 def)
% Number of atoms : 53 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 75 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,axiom,
( equalish(A,C)
| ~ equalish(B,C)
| ~ equalish(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(f1_nnf,plain,
! [A,B,C] :
( equalish(A,C)
| ~ equalish(B,C)
| ~ equalish(A,B) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A,B,C] :
( equalish(A,C)
| ~ equalish(B,C)
| ~ equalish(A,B) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
ifeq(equalish(X0,X1),true,ifeq(equalish(X1,X2),true,equalish(X0,X2),true),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f7,axiom,
equalish(subtract(add(A,B),C),add(subtract(A,C),B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity2) ).
fof(f7_nnf,plain,
! [A,B,C] : equalish(subtract(add(A,B),C),add(subtract(A,C),B)),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [A,B,C] : equalish(subtract(add(A,B),C),add(subtract(A,C),B)),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
equalish(subtract(add(X0,X1),X2),add(subtract(X0,X2),X1)),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(hi7,axiom,
equalish(subtract(add(X0,X1),X2),add(subtract(X0,X2),X1)) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(f2,axiom,
equalish(add(A,B),add(B,A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_addition) ).
fof(f2_nnf,plain,
! [A,B] : equalish(add(A,B),add(B,A)),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A,B] : equalish(add(A,B),add(B,A)),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
equalish(add(X0,X1),add(X1,X0)),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
equalish(add(X0,X1),add(X1,X0)) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h2,plain,
equalish(subtract(add(c,a),b),add(a,subtract(c,b))) = true,
inference(hyper_resolution,[status(thm)],[hi1,hi7,hi2]) ).
cnf(h0,plain,
equalish(add(a,c),add(c,a)) = true,
inference(hyper_resolution,[status(thm)],[hi2]) ).
cnf(f10,axiom,
( equalish(C,subtract(B,D))
| ~ equalish(C,subtract(A,D))
| ~ equalish(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subtract_substitution1) ).
fof(f10_nnf,plain,
! [A,B,C,D] :
( equalish(C,subtract(B,D))
| ~ equalish(C,subtract(A,D))
| ~ equalish(A,B) ),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
! [A,B,C,D] :
( equalish(C,subtract(B,D))
| ~ equalish(C,subtract(A,D))
| ~ equalish(A,B) ),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
( equalish(X2,subtract(X1,X3))
| ~ equalish(X2,subtract(X0,X3))
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(hi10,axiom,
ifeq(equalish(X0,X1),true,ifeq(equalish(X2,subtract(X0,X3)),true,equalish(X2,subtract(X1,X3)),true),true) = true,
inference(equality_encoding,[status(esa)],[c10]) ).
cnf(f6,axiom,
equalish(add(subtract(A,B),C),subtract(add(A,C),B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity1) ).
fof(f6_nnf,plain,
! [A,B,C] : equalish(add(subtract(A,B),C),subtract(add(A,C),B)),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [A,B,C] : equalish(add(subtract(A,B),C),subtract(add(A,C),B)),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
equalish(add(subtract(X0,X1),X2),subtract(add(X0,X2),X1)),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(hi6,axiom,
equalish(add(subtract(X0,X1),X2),subtract(add(X0,X2),X1)) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(h1,plain,
equalish(add(subtract(a,b),c),subtract(add(c,a),b)) = true,
inference(hyper_resolution,[status(thm)],[hi10,h0,hi6]) ).
cnf(t7,plain,
equalish(add(subtract(a,b),c),add(a,subtract(c,b))) = true,
inference(hyper_resolution,[status(thm)],[hi1,h1,h2]) ).
cnf(t20,plain,
equalish(add(subtract(a,b),c),add(a,subtract(c,b))) = true,
inference(orient,[status(thm)],[t7]) ).
cnf(f12,negated_conjecture,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
fof(f12_nnf,plain,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
inference(skolemisation,[status(esa)],[f12_nnf]) ).
cnf(c12,plain,
~ equalish(add(subtract(a,b),c),add(a,subtract(c,b))),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(goal_0,negated_conjecture,
equalish(add(subtract(a,b),c),add(a,subtract(c,b))) != true,
inference(equality_encoding,[status(esa)],[c12]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t20]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.03/0.36 % Computer : n026.cluster.edu
% 0.03/0.36 % Model : x86_64 x86_64
% 0.03/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.36 % Memory : 8046.5625MB
% 0.03/0.36 % OS : Linux 6.8.0-71-generic
% 0.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Thu Sep 24 02:40:24 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.30/1.46 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.30/1.46 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------