%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV011-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n015.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:11:00 PM UTC 2026
% Result : Unsatisfiable 6.18s 1.37s
% Output : Proof 6.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 14 unt; 0 def)
% Number of atoms : 22 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 5 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f2,negated_conjecture,
( ~ b_holds(key(A,a))
| ~ a_holds(key(A,b)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f2_nnf,plain,
! [A] :
( ~ b_holds(key(A,a))
| ~ a_holds(key(A,b)) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A] :
( ~ b_holds(key(A,a))
| ~ a_holds(key(A,b)) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ b_holds(key(X0,a))
| ~ a_holds(key(X0,b)) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(a_holds(key(X0,b)),true,ifeq(b_holds(key(X0,a)),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(f1,axiom,
a_holds(key(generate_key(an_a_nonce),b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3_13) ).
fof(f1_nnf,plain,
a_holds(key(generate_key(an_a_nonce),b)),
inference(nnf_transformation,[status(thm)],[f1]) ).
cnf(c1,plain,
a_holds(key(generate_key(an_a_nonce),b)),
inference(cnf_transformation,[status(esa)],[f1_nnf]) ).
cnf(hi1,axiom,
a_holds(key(generate_key(an_a_nonce),b)) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f0,axiom,
b_holds(key(generate_key(an_a_nonce),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1_11) ).
fof(f0_nnf,plain,
b_holds(key(generate_key(an_a_nonce),a)),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
b_holds(key(generate_key(an_a_nonce),a)),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,axiom,
b_holds(key(generate_key(an_a_nonce),a)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi2,hi1,hi0]) ).
cnf(t7,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t7]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV011-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 18:20:11 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.18/1.37 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.18/1.37 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------