%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWW102+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n003.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:26:46 PM UTC 2026
% Result : Theorem 35.38s 5.63s
% Output : Proof 35.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 17 unt; 0 def)
% Number of atoms : 66 ( 46 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 49 ( 19 ~; 23 |; 4 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 1 sgn 17 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f41,axiom,
not1(false) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_axiom2) ).
fof(f41_nnf,plain,
not1(false) = true,
inference(nnf_transformation,[status(thm)],[f41]) ).
cnf(c95,plain,
not1(false) = true,
inference(cnf_transformation,[status(esa)],[f41_nnf]) ).
fof(f8,axiom,
! [A,B] :
( ~ bool(A)
=> impl(A,B) = phi(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',impl_axiom1) ).
fof(f8_nnf,plain,
! [A,B] :
( impl(A,B) = phi(A)
| bool(A) ),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [A,B] :
( impl(A,B) = phi(A)
| bool(A) ),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c55,plain,
( impl(X0,X1) = phi(X0)
| bool(X0) ),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
fof(f43,axiom,
! [P] : not2(P) = impl(P,false2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_not2) ).
fof(f43_nnf,plain,
! [P] : not2(P) = impl(P,false2),
inference(nnf_transformation,[status(thm)],[f43]) ).
fof(f43_sk,plain,
! [P] : not2(P) = impl(P,false2),
inference(skolemisation,[status(esa)],[f43_nnf]) ).
cnf(c97,plain,
not2(X0) = impl(X0,false2),
inference(cnf_transformation,[status(esa)],[f43_sk]) ).
cnf(p307,plain,
( not2(X0) = phi(X0)
| bool(X0) ),
inference(superposition,[status(thm)],[c55,c97]) ).
fof(f44,conjecture,
! [P] : not1(P) = not2(P),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_not2) ).
fof(f44_neg,negated_conjecture,
~ ! [P] : not1(P) = not2(P),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f44_nnf,plain,
? [P] : not1(P) != not2(P),
inference(nnf_transformation,[status(thm)],[f44_neg]) ).
fof(f44_sk,plain,
not1(sk7) != not2(sk7),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk7])],[f44_nnf]) ).
cnf(c98,plain,
not1(sk7) != not2(sk7),
inference(cnf_transformation,[status(esa)],[f44_sk]) ).
cnf(p400,plain,
( not1(sk7) != phi(sk7)
| bool(sk7) ),
inference(superposition,[status(thm)],[p307,c98]) ).
fof(f40,axiom,
! [A] :
( ~ bool(A)
=> not1(A) = phi(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_axiom1) ).
fof(f40_nnf,plain,
! [A] :
( not1(A) = phi(A)
| bool(A) ),
inference(nnf_transformation,[status(thm)],[f40]) ).
fof(f40_sk,plain,
! [A] :
( not1(A) = phi(A)
| bool(A) ),
inference(skolemisation,[status(esa)],[f40_nnf]) ).
cnf(c94,plain,
( not1(X0) = phi(X0)
| bool(X0) ),
inference(cnf_transformation,[status(esa)],[f40_sk]) ).
cnf(p415,plain,
( bool(sk7)
| bool(sk7) ),
inference(resolution,[status(thm)],[p400,c94]) ).
cnf(p416,plain,
bool(sk7),
inference(factoring,[status(thm)],[p415]) ).
fof(f0,axiom,
! [X] :
( bool(X)
<=> ( X = true
| X = false ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_bool) ).
fof(f0_nnf,plain,
! [X] :
( ( ( X != true
& X != false )
| bool(X) )
& ( X = true
| X = false
| ~ bool(X) ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X] :
( ( ( X != true
& X != false )
| bool(X) )
& ( X = true
| X = false
| ~ bool(X) ) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( X0 = true
| X0 = false
| ~ bool(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p417,plain,
( sk7 = true
| sk7 = false ),
inference(resolution,[status(thm)],[p416,c0]) ).
cnf(p477,plain,
( false != not2(sk7)
| sk7 = false ),
inference(superposition,[status(thm)],[p417,c98]) ).
cnf(p520,plain,
( false != false
| sk7 = false
| sk7 = false ),
inference(superposition,[status(thm)],[p417,p477]) ).
cnf(p1464,plain,
( false != false
| sk7 = false ),
inference(factoring,[status(thm)],[p520]) ).
cnf(p1465,plain,
sk7 = false,
inference(equality_resolution,[status(thm)],[p1464]) ).
cnf(p1466,plain,
not1(false) != not2(false),
inference(demodulation,[status(thm)],[p1465,c98]) ).
cnf(p1595,plain,
true != true,
inference(superposition,[status(thm)],[c95,p1466]) ).
cnf(p1596,plain,
$false,
inference(equality_resolution,[status(thm)],[p1595]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW102+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 21:41:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 35.38/5.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.38/5.63 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------