%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV397+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n007.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:13:09 PM UTC 2026
% Result : Theorem 204.89s 28.45s
% Output : Proof 204.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 41 unt; 0 def)
% Number of atoms : 102 ( 30 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 82 ( 41 ~; 23 |; 11 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-4 aty)
% Number of variables : 112 ( 23 sgn 56 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f41,conjecture,
! [U,V,W,X] :
( ok(remove_cpq(triple(U,V,W),X))
=> contains_slb(V,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l33_co) ).
fof(f41_neg,negated_conjecture,
~ ! [U,V,W,X] :
( ok(remove_cpq(triple(U,V,W),X))
=> contains_slb(V,X) ),
inference(negated_conjecture,[status(cth)],[f41]) ).
fof(f41_nnf,plain,
? [U,V,W,X] :
( ~ contains_slb(V,X)
& ok(remove_cpq(triple(U,V,W),X)) ),
inference(nnf_transformation,[status(thm)],[f41_neg]) ).
fof(f41_sk,plain,
( ~ contains_slb(sk1,sk3)
& ok(remove_cpq(triple(sk0,sk1,sk2),sk3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2,sk3])],[f41_nnf]) ).
cnf(c52,plain,
ok(remove_cpq(triple(sk0,sk1,sk2),sk3)),
inference(cnf_transformation,[status(esa)],[f41_sk]) ).
cnf(t42,plain,
ok(remove_cpq(triple(sk0,sk1,sk2),sk3)) = true,
inference(equality_encoding,[status(esa)],[c52]) ).
cnf(t783,plain,
ok(remove_cpq(triple(sk0,sk1,sk2),sk3)) = true,
inference(orient,[status(thm)],[t42]) ).
cnf(t40,plain,
ifeq(eq(X1,X2),true,X1,X2) = X2,
introduced(definition) ).
cnf(t259,plain,
ifeq(eq(X1,X2),true,X1,X2) = X2,
inference(orient,[status(thm)],[t40]) ).
fof(f30,axiom,
! [U,V,W,X] :
( ~ contains_slb(V,X)
=> remove_cpq(triple(U,V,W),X) = triple(U,V,bad) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax43) ).
fof(f30_nnf,plain,
! [U,V,W,X] :
( remove_cpq(triple(U,V,W),X) = triple(U,V,bad)
| contains_slb(V,X) ),
inference(nnf_transformation,[status(thm)],[f30]) ).
fof(f30_sk,plain,
! [V,X,U,W] :
( remove_cpq(triple(U,V,W),X) = triple(U,V,bad)
| contains_slb(V,X) ),
inference(skolemisation,[status(esa)],[f30_nnf]) ).
cnf(c41,plain,
( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[status(esa)],[f30_sk]) ).
cnf(t201,plain,
or(contains_slb(X1,X2),eq(remove_cpq(triple(X3,X1,X4),X2),triple(X3,X1,bad))) = true,
inference(equality_encoding,[status(esa)],[c41]) ).
cnf(t331,plain,
or(contains_slb(X1,X2),eq(remove_cpq(triple(X3,X1,X4),X2),triple(X3,X1,bad))) = true,
inference(orient,[status(thm)],[t201]) ).
cnf(c53,plain,
~ contains_slb(sk1,sk3),
inference(cnf_transformation,[status(esa)],[f41_sk]) ).
cnf(t4,plain,
contains_slb(sk1,sk3) = false,
inference(equality_encoding,[status(esa)],[c53]) ).
cnf(t817,plain,
contains_slb(sk1,sk3) = false,
inference(orient,[status(thm)],[t4]) ).
cnf(t822,plain,
true = or(false,eq(remove_cpq(triple(X1,sk1,X2),sk3),triple(X1,sk1,bad))),
inference(cp,[status(thm)],[t331,t817]) ).
cnf(t10,plain,
or(false,X1) = X1,
introduced(definition) ).
cnf(t257,plain,
or(false,X1) = X1,
inference(orient,[status(thm)],[t10]) ).
cnf(t9804,plain,
true = eq(remove_cpq(triple(X1,sk1,X2),sk3),triple(X1,sk1,bad)),
inference(step,[status(thm)],[t822,t257]) ).
cnf(t8285,plain,
eq(remove_cpq(triple(X1,sk1,X2),sk3),triple(X1,sk1,bad)) = true,
inference(orient,[status(thm)],[t9804]) ).
cnf(t8286,plain,
triple(X1,sk1,bad) = ifeq(true,true,remove_cpq(triple(X1,sk1,X2),sk3),triple(X1,sk1,bad)),
inference(cp,[status(thm)],[t259,t8285]) ).
cnf(t20,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t258,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t20]) ).
cnf(t9805,plain,
triple(X1,sk1,bad) = remove_cpq(triple(X1,sk1,X2),sk3),
inference(step,[status(thm)],[t8286,t258]) ).
cnf(t8287,plain,
remove_cpq(triple(X1,sk1,X2),sk3) = triple(X1,sk1,bad),
inference(orient,[status(thm)],[t9805]) ).
cnf(t9806,plain,
ok(triple(sk0,sk1,bad)) = true,
inference(step,[status(thm)],[t783,t8287]) ).
fof(f27,axiom,
! [U,V] :
( ok(triple(U,V,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).
fof(f27_nnf,plain,
! [U,V] :
( ( ~ $false
| ok(triple(U,V,bad)) )
& ( $false
| ~ ok(triple(U,V,bad)) ) ),
inference(nnf_transformation,[status(thm)],[f27]) ).
fof(f27_sk,plain,
! [U,V] :
( ( ~ $false
| ok(triple(U,V,bad)) )
& ( $false
| ~ ok(triple(U,V,bad)) ) ),
inference(skolemisation,[status(esa)],[f27_nnf]) ).
cnf(c37,plain,
( $false
| ~ ok(triple(X0,X1,bad)) ),
inference(cnf_transformation,[status(esa)],[f27_sk]) ).
cnf(t21,plain,
ok(triple(X1,X2,bad)) = false,
inference(equality_encoding,[status(esa)],[c37]) ).
cnf(t832,plain,
ok(triple(X1,X2,bad)) = false,
inference(orient,[status(thm)],[t21]) ).
cnf(t9807,plain,
false = true,
inference(step,[status(thm)],[t9806,t832]) ).
cnf(t8430,plain,
false = true,
inference(rw,[status(thm)],[t9807]) ).
cnf(t8431,plain,
false = true,
inference(orient,[status(thm)],[t8430]) ).
fof(f3,axiom,
! [U,V] :
( strictly_less_than(U,V)
<=> ( ~ less_than(V,U)
& less_than(U,V) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f3_nnf,plain,
! [U,V] :
( ( less_than(V,U)
| ~ less_than(U,V)
| strictly_less_than(U,V) )
& ( ( ~ less_than(V,U)
& less_than(U,V) )
| ~ strictly_less_than(U,V) ) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [U,V] :
( ( less_than(V,U)
| ~ less_than(U,V)
| strictly_less_than(U,V) )
& ( ( ~ less_than(V,U)
& less_than(U,V) )
| ~ strictly_less_than(U,V) ) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c4,plain,
( ~ less_than(X1,X0)
| ~ strictly_less_than(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
fof(f5,axiom,
~ isnonempty_slb(create_slb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).
fof(f5_nnf,plain,
~ isnonempty_slb(create_slb),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
~ isnonempty_slb(create_slb),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c7,plain,
~ isnonempty_slb(create_slb),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
fof(f7,axiom,
! [U] : ~ contains_slb(create_slb,U),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f7_nnf,plain,
! [U] : ~ contains_slb(create_slb,U),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [U] : ~ contains_slb(create_slb,U),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c9,plain,
~ contains_slb(create_slb,X0),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
fof(f9,axiom,
! [U,V] : ~ pair_in_list(create_slb,U,V),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f9_nnf,plain,
! [U,V] : ~ pair_in_list(create_slb,U,V),
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
! [U,V] : ~ pair_in_list(create_slb,U,V),
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c13,plain,
~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
fof(f25,axiom,
! [U,V,W,X,Y] :
( strictly_less_than(X,Y)
=> ( check_cpq(triple(U,insert_slb(V,pair(X,Y)),W))
<=> $false ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f25_nnf,plain,
! [U,V,W,X,Y] :
( ( ( ~ $false
| check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) )
& ( $false
| ~ check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) ) )
| ~ strictly_less_than(X,Y) ),
inference(nnf_transformation,[status(thm)],[f25]) ).
fof(f25_sk,plain,
! [X,Y,U,V,W] :
( ( ( ~ $false
| check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) )
& ( $false
| ~ check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) ) )
| ~ strictly_less_than(X,Y) ),
inference(skolemisation,[status(esa)],[f25_nnf]) ).
cnf(c33,plain,
( $false
| ~ check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),X2))
| ~ strictly_less_than(X3,X4) ),
inference(cnf_transformation,[status(esa)],[f25_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c4,c7,c9,c13,c33,c37,c53]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t8431]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV397+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.13/0.38 % Computer : n007.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Thu Sep 24 19:26:37 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 204.89/28.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 204.89/28.45 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------