%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n014.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:13:35 PM UTC 2026
% Result : Theorem 7.53s 6.67s
% Output : Proof 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 11 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 85 ( 29 ~; 48 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 50 ( 5 sgn 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [A,B,C] :
( ( less(B,C)
& less(A,B) )
=> less(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_less) ).
fof(f2_nnf,plain,
! [A,B,C] :
( less(A,C)
| ~ less(B,C)
| ~ less(A,B) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A,B,C] :
( less(A,C)
| ~ less(B,C)
| ~ less(A,B) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c3,plain,
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
fof(f3,axiom,
! [A] :
? [B] : less(A,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',serial_less) ).
fof(f3_nnf,plain,
! [A] :
? [B] : less(A,B),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A] : less(A,sk1(A)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f3_nnf]) ).
cnf(c4,plain,
less(X0,sk1(X0)),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p9,plain,
( less(X0,X1)
| ~ less(sk1(X0),X1) ),
inference(resolution,[status(thm)],[c3,c4]) ).
fof(f1,axiom,
! [A] :
( ? [B] :
( p(B)
& less(A,B) )
| p(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_to_left) ).
fof(f1_nnf,plain,
! [A] :
( ? [B] :
( p(B)
& less(A,B) )
| p(A) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A] :
( ( p(sk0(A))
& less(A,sk0(A)) )
| p(A) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).
cnf(c1,plain,
( less(X0,sk0(X0))
| p(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p12,plain,
( p(sk1(X0))
| less(X0,sk0(sk1(X0))) ),
inference(resolution,[status(thm)],[p9,c1]) ).
fof(f0,axiom,
! [A,B] :
( ( p(B)
& less(A,B)
& p(A) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_to_right) ).
fof(f0_nnf,plain,
! [A,B] :
( goal
| ~ p(B)
| ~ less(A,B)
| ~ p(A) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A,B] :
( goal
| ~ p(B)
| ~ less(A,B)
| ~ p(A) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c2,plain,
( p(sk0(X0))
| p(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p7,plain,
( p(X0)
| goal
| ~ p(X1)
| ~ less(sk0(X0),X1) ),
inference(resolution,[status(thm)],[c0,c2]) ).
cnf(p35,plain,
( p(X0)
| goal
| ~ p(sk0(sk1(sk0(X0))))
| p(sk1(sk0(X0))) ),
inference(resolution,[status(thm)],[p12,p7]) ).
cnf(p141,plain,
( p(sk1(sk0(X0)))
| p(X0)
| goal
| p(sk1(sk0(X0))) ),
inference(resolution,[status(thm)],[p35,c2]) ).
cnf(p235,plain,
( p(X0)
| goal
| p(sk1(sk0(X0))) ),
inference(factoring,[status(thm)],[p141]) ).
cnf(p13,plain,
( p(X0)
| goal
| ~ p(sk1(sk0(X0))) ),
inference(resolution,[status(thm)],[p7,c4]) ).
cnf(p238,plain,
( p(X0)
| goal
| p(X0)
| goal ),
inference(resolution,[status(thm)],[p235,p13]) ).
cnf(p240,plain,
( goal
| p(X0)
| goal ),
inference(factoring,[status(thm)],[p238]) ).
cnf(p245,plain,
( p(X0)
| goal ),
inference(factoring,[status(thm)],[p240]) ).
cnf(p246,plain,
( goal
| ~ p(X1)
| ~ less(X0,X1)
| goal ),
inference(resolution,[status(thm)],[p245,c0]) ).
cnf(p260,plain,
( ~ p(X1)
| ~ less(X0,X1)
| goal ),
inference(factoring,[status(thm)],[p246]) ).
cnf(p261,plain,
( ~ p(sk1(X0))
| goal ),
inference(resolution,[status(thm)],[p260,c4]) ).
cnf(p262,plain,
( goal
| goal ),
inference(resolution,[status(thm)],[p261,p245]) ).
cnf(p263,plain,
goal,
inference(factoring,[status(thm)],[p262]) ).
fof(f4,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f4_neg,negated_conjecture,
~ goal,
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f4_nnf,plain,
~ goal,
inference(nnf_transformation,[status(thm)],[f4_neg]) ).
fof(f4_sk,plain,
~ goal,
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c5,plain,
~ goal,
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p268,plain,
$false,
inference(resolution,[status(thm)],[p263,c5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.58 % Computer : n014.cluster.edu
% 0.10/5.58 % Model : x86_64 x86_64
% 0.10/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.58 % Memory : 8046.5625MB
% 0.10/5.58 % OS : Linux 6.8.0-71-generic
% 0.10/5.58 % CPULimit : 300
% 0.10/5.58 % WCLimit : 300
% 0.10/5.58 % DateTime : Thu Sep 24 01:28:24 UTC 2026
% 0.10/5.58 % CPUTime :
% 0.10/5.58 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.53/6.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.53/6.67 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------