%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN133-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 03:33:53 PM UTC 2026
% Result : Unsatisfiable 7.01s 1.37s
% Output : Proof 7.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 12 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f368,negated_conjecture,
~ m0(d,X,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
! [X] : ~ m0(d,X,d),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
! [X] : ~ m0(d,X,d),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ m0(d,X0,d),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(t50,plain,
eq(m0(d,X1,d),true) = efalse,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(t305,plain,
eq(m0(d,X1,d),true) = efalse,
inference(orient,[status(thm)],[t50]) ).
cnf(f18,axiom,
m0(X,d,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_19) ).
fof(f18_nnf,plain,
! [X,Y] : m0(X,d,Y),
inference(nnf_transformation,[status(thm)],[f18]) ).
fof(f18_sk,plain,
! [X,Y] : m0(X,d,Y),
inference(skolemisation,[status(esa)],[f18_nnf]) ).
cnf(c18,plain,
m0(X0,d,X1),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(t1,plain,
m0(X1,d,X2) = true,
inference(equality_encoding,[status(esa)],[c18]) ).
cnf(t116,plain,
m0(X1,d,X2) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(t306,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t305,t116]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t304,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t317,plain,
efalse = etrue,
inference(step,[status(thm)],[t306,t304]) ).
cnf(t307,plain,
efalse = etrue,
inference(orient,[status(thm)],[t317]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t307]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN133-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 00:18:09 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.01/1.37 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.01/1.37 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------