%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : REL003+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 : Sun Sep 27 08:24:12 AM UTC 2026
% Result : Theorem 10.36s 8.45s
% Output : CNFRefutation 10.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 43 ( 42 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 13 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 14 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(maddux1_join_commutativity,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0) ).
fof(converse_idempotence,axiom,
! [X0] : converse(converse(X0)) = X0 ).
fof(converse_additivity,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)) ).
fof(goals,conjecture,
! [X0,X1] :
( ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 )
& ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) ) ),
inference(negate_conjecture,[status(cth)],[goals]) ).
cnf(c0,plain,
join(X0,X1) = join(X1,X0),
inference(clausification,[status(esa)],[maddux1_join_commutativity]) ).
cnf(c7,plain,
converse(converse(X0)) = X0,
inference(clausification,[status(esa)],[converse_idempotence]) ).
cnf(c8,plain,
converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(clausification,[status(esa)],[converse_additivity]) ).
cnf(c13,plain,
( join(converse(sK25),converse(sK26)) = converse(sK26)
| join(sK25,sK26) = sK26 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c16,plain,
( join(sK25,sK26) != sK26
| join(converse(sK25),converse(sK26)) != converse(sK26) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( join(sK25,sK26) = sK26
| join(converse(sK26),converse(sK25)) = converse(sK26) ),
inference(demodulation,[status(thm)],[c13,c0]) ).
cnf(d1,plain,
( join(sK26,sK25) = sK26
| join(converse(sK26),converse(sK25)) = converse(sK26) ),
inference(demodulation,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
( join(sK26,sK25) = sK26
| converse(join(sK26,sK25)) = converse(sK26) ),
inference(demodulation,[status(thm)],[d1,c8]) ).
cnf(d3,plain,
( join(sK26,sK25) = sK26
| converse(converse(sK26)) = join(sK26,sK25) ),
inference(superposition,[status(thm)],[d2,c7]) ).
cnf(d4,plain,
( sK26 = join(sK26,sK25)
| join(sK26,sK25) = sK26 ),
inference(demodulation,[status(thm)],[d3,c7]) ).
cnf(d5,plain,
( sK26 = join(sK26,sK25)
| sK26 != sK26 ),
inference(equality_factoring,[status(thm)],[d4]) ).
cnf(d6,plain,
sK26 = join(sK26,sK25),
inference(equality_resolution,[status(thm)],[d5]) ).
cnf(d7,plain,
( join(sK25,sK26) != sK26
| join(converse(sK26),converse(sK25)) != converse(sK26) ),
inference(demodulation,[status(thm)],[c16,c0]) ).
cnf(d8,plain,
( join(sK26,sK25) != sK26
| join(converse(sK26),converse(sK25)) != converse(sK26) ),
inference(demodulation,[status(thm)],[d7,c0]) ).
cnf(d9,plain,
( join(sK26,sK25) != sK26
| converse(join(sK26,sK25)) != converse(sK26) ),
inference(demodulation,[status(thm)],[d8,c8]) ).
cnf(d10,plain,
( converse(join(sK26,sK25)) != converse(sK26)
| sK26 != sK26 ),
inference(demodulation,[status(thm)],[d9,d6]) ).
cnf(d11,plain,
( converse(sK26) != converse(sK26)
| sK26 != sK26 ),
inference(demodulation,[status(thm)],[d10,d6]) ).
cnf(d12,plain,
sK26 != sK26,
inference(equality_resolution,[status(thm)],[d11]) ).
cnf(d13,plain,
$false,
inference(equality_resolution,[status(thm)],[d12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL003+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/5.43 % Computer : n004.cluster.edu
% 0.16/5.43 % Model : x86_64 x86_64
% 0.16/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.43 % Memory : 8046.5625MB
% 0.16/5.43 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Sat Sep 26 05:24:58 UTC 2026
% 0.16/5.44 % CPUTime :
% 0.16/5.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.36/8.45 % SZS status Theorem for theBenchmark.p
% 10.36/8.45 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------