%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : REL003-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/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:34:36 PM UTC 2026
% Result : Unsatisfiable 8.38s 1.58s
% Output : Proof 8.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f13,negated_conjecture,
( join(converse(sk1),converse(sk2)) = converse(sk2)
| join(sk1,sk2) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
fof(f13_nnf,plain,
( join(converse(sk1),converse(sk2)) = converse(sk2)
| join(sk1,sk2) = sk2 ),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
( join(converse(sk1),converse(sk2)) = converse(sk2)
| join(sk1,sk2) = sk2 ),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
( join(converse(sk1),converse(sk2)) = converse(sk2)
| join(sk1,sk2) = sk2 ),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(f8,axiom,
converse(join(A,B)) = join(converse(A),converse(B)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',converse_additivity_9) ).
fof(f8_nnf,plain,
! [A,B] : converse(join(A,B)) = join(converse(A),converse(B)),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [A,B] : converse(join(A,B)) = join(converse(A),converse(B)),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(p148,plain,
( sk2 = join(sk1,sk2)
| join(sk1,sk2) = sk2 ),
inference(superposition,[status(thm)],[c13,c8]) ).
cnf(f0,axiom,
join(A,B) = join(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux1_join_commutativity_1) ).
fof(f0_nnf,plain,
! [A,B] : join(A,B) = join(B,A),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A,B] : join(A,B) = join(B,A),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p161,plain,
( sk2 = join(sk1,sk2)
| sk2 = join(sk1,sk2) ),
inference(superposition,[status(thm)],[p148,c0]) ).
cnf(p164,plain,
sk2 = join(sk1,sk2),
inference(factoring,[status(thm)],[p161]) ).
cnf(p165,plain,
join(sk1,sk2) = sk2,
inference(superposition,[status(thm)],[p164,c0]) ).
cnf(p152,plain,
join(converse(X0),converse(X1)) = converse(join(X1,X0)),
inference(superposition,[status(thm)],[c8,c0]) ).
cnf(f14,negated_conjecture,
( join(converse(sk1),converse(sk2)) != converse(sk2)
| join(sk1,sk2) != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
fof(f14_nnf,plain,
( join(converse(sk1),converse(sk2)) != converse(sk2)
| join(sk1,sk2) != sk2 ),
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
( join(converse(sk1),converse(sk2)) != converse(sk2)
| join(sk1,sk2) != sk2 ),
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c14,plain,
( join(converse(sk1),converse(sk2)) != converse(sk2)
| join(sk1,sk2) != sk2 ),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
cnf(p155,plain,
( converse(join(sk2,sk1)) != converse(sk2)
| join(sk1,sk2) != sk2 ),
inference(demodulation,[status(thm)],[p152,c14]) ).
cnf(p166,plain,
( converse(join(sk2,sk1)) != converse(sk2)
| sk2 != sk2 ),
inference(demodulation,[status(thm)],[p165,p155]) ).
cnf(p337,plain,
converse(sk2) != converse(sk2),
inference(equality_resolution,[status(thm)],[p166]) ).
cnf(p338,plain,
$false,
inference(equality_resolution,[status(thm)],[p337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL003-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 07:08:40 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 8.38/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.38/1.58 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------