%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN242-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n009.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:34:09 PM UTC 2026
% Result : Unsatisfiable 7.58s 1.67s
% Output : Proof 7.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 30 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f60,axiom,
( ~ s0(d)
| ~ l0(a)
| m1(a,a,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_023) ).
fof(f60_nnf,plain,
( ~ s0(d)
| ~ l0(a)
| m1(a,a,a) ),
inference(nnf_transformation,[status(thm)],[f60]) ).
fof(f60_sk,plain,
( ~ s0(d)
| ~ l0(a)
| m1(a,a,a) ),
inference(skolemisation,[status(esa)],[f60_nnf]) ).
cnf(c60,plain,
( ~ s0(d)
| ~ l0(a)
| m1(a,a,a) ),
inference(cnf_transformation,[status(esa)],[f60_sk]) ).
cnf(hi60,axiom,
ifeq(l0(a),true,ifeq(s0(d),true,m1(a,a,a),true),true) = true,
inference(equality_encoding,[status(esa)],[c60]) ).
cnf(f19,axiom,
l0(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
fof(f19_nnf,plain,
l0(a),
inference(nnf_transformation,[status(thm)],[f19]) ).
cnf(c19,plain,
l0(a),
inference(cnf_transformation,[status(esa)],[f19_nnf]) ).
cnf(hi19,axiom,
l0(a) = true,
inference(equality_encoding,[status(esa)],[c19]) ).
cnf(f0,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f0_nnf,plain,
s0(d),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
s0(d),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,axiom,
s0(d) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t0,plain,
m1(a,a,a) = true,
inference(hyper_resolution,[status(thm)],[hi60,hi19,hi0]) ).
cnf(t22,plain,
m1(a,a,a) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(f368,negated_conjecture,
~ m1(a,a,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ m1(a,a,a),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ m1(a,a,a),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ m1(a,a,a),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
m1(a,a,a) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t22]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN242-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 00:36:28 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.58/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.58/1.67 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------