%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 : Sun Sep 27 08:04:09 AM UTC 2026
% Result : Theorem 14.66s 2.36s
% Output : CNFRefutation 14.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 21 ~; 21 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 28 ( 1 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_to_right,axiom,
! [X0,X1] :
( ( p(X1)
& less(X0,X1)
& p(X0) )
=> goal ) ).
fof(right_to_left,axiom,
! [X0] :
( ? [X1] :
( p(X1)
& less(X0,X1) )
| p(X0) ) ).
fof(transitive_less,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ) ).
fof(serial_less,axiom,
! [X0] :
? [X1] : less(X0,X1) ).
fof(goal_to_be_proved,conjecture,
goal ).
fof(negated_conjecture,negated_conjecture,
~ goal,
inference(negate_conjecture,[status(cth)],[goal_to_be_proved]) ).
cnf(c0,plain,
( goal
| ~ p(X1)
| ~ less(X0,X1)
| ~ p(X0) ),
inference(clausification,[status(esa)],[left_to_right]) ).
cnf(c1,plain,
( less(X0,sK3(X0))
| p(X0) ),
inference(clausification,[status(esa)],[right_to_left]) ).
cnf(c2,plain,
( p(sK3(X0))
| p(X0) ),
inference(clausification,[status(esa)],[right_to_left]) ).
cnf(c3,plain,
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(clausification,[status(esa)],[transitive_less]) ).
cnf(c4,plain,
less(X0,sK8(X0)),
inference(clausification,[status(esa)],[serial_less]) ).
cnf(c5,plain,
~ goal,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ less(X0,X1)
| ~ p(X1)
| ~ p(X0) ),
inference(resolution,[status(thm)],[c5,c0]) ).
cnf(d1,plain,
( ~ p(X0)
| ~ p(sK8(X0)) ),
inference(resolution,[status(thm)],[c4,d0]) ).
cnf(d2,plain,
( p(X1)
| ~ less(X0,X1)
| less(X0,sK3(X1)) ),
inference(resolution,[status(thm)],[c3,c1]) ).
cnf(d3,plain,
( ~ p(X1)
| ~ p(sK3(X0))
| ~ less(X1,X0)
| p(X0) ),
inference(resolution,[status(thm)],[d2,d0]) ).
cnf(d4,plain,
( ~ p(sK3(sK8(X0)))
| p(sK8(X0))
| ~ p(X0) ),
inference(resolution,[status(thm)],[d3,c4]) ).
cnf(d5,plain,
( p(sK8(X0))
| p(sK8(X0))
| ~ p(X0) ),
inference(resolution,[status(thm)],[d4,c2]) ).
cnf(d6,plain,
( ~ p(X0)
| ~ p(X0) ),
inference(resolution,[status(thm)],[d5,d1]) ).
cnf(d7,plain,
p(sK3(X0)),
inference(resolution,[status(thm)],[d6,c2]) ).
cnf(d8,plain,
$false,
inference(resolution,[status(thm)],[d6,d7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MSC012+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.42 % Computer : n003.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Sat Sep 26 00:17:08 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.66/2.36 % SZS status Theorem for theBenchmark.p
% 14.66/2.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------