%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN361+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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:39:51 PM UTC 2026
% Result : Theorem 1.04s 16.21s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 66 ( 27 ~; 12 |; 18 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 59 ( 0 sgn 44 !; 15 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X1,X2] :
( big_p(X1,X2)
=> ~ big_q(X1,X2) )
& ! [X1] :
( big_s(X1)
=> ? [X2] : big_q(X2,X1) )
& ? [X0] :
! [X1] : big_p(X1,X0) )
=> ? [X3] : ~ big_s(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2112) ).
fof(f2,negated_conjecture,
~ ( ( ! [X1,X2] :
( big_p(X1,X2)
=> ~ big_q(X1,X2) )
& ! [X1] :
( big_s(X1)
=> ? [X2] : big_q(X2,X1) )
& ? [X0] :
! [X1] : big_p(X1,X0) )
=> ? [X3] : ~ big_s(X3) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ! [X4,X5] :
( big_p(X4,X5)
=> ~ big_q(X4,X5) )
& ! [X2] :
( big_s(X2)
=> ? [X3] : big_q(X3,X2) )
& ? [X0] :
! [X1] : big_p(X1,X0) )
=> ? [X6] : ~ big_s(X6) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X4,X5] :
( ~ big_p(X4,X5)
| ~ big_q(X4,X5) )
& ! [X2] :
( ~ big_s(X2)
| ? [X3] : big_q(X3,X2) )
& ? [X0] :
! [X1] : big_p(X1,X0)
& ! [X6] : big_s(X6) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X4,X5] :
( ~ big_p(X4,X5)
| ~ big_q(X4,X5) )
& ! [X2] :
( ~ big_s(X2)
| ? [X3] : big_q(X3,X2) )
& ? [X0] :
! [X1] : big_p(X1,X0)
& ! [X6] : big_s(X6) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X5,X6] :
( ~ big_p(X5,X6)
| ~ big_q(X5,X6) )
& ! [X3] :
( ~ big_s(X3)
| ? [X4] : big_q(X4,X3) )
& ? [X1] :
! [X2] : big_p(X2,X1)
& ! [X0] : big_s(X0) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X5,X6] :
( ~ big_p(X5,X6)
| ~ big_q(X5,X6) )
& ! [X3] :
( ~ big_s(X3)
| big_q(sK1(X3),X3) )
& ! [X2] : big_p(X2,sK0)
& ! [X0] : big_s(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X1,sK0),skolemize(X4,sK1(X3))],[f6]) ).
fof(f8,plain,
! [X6,X5] :
( ~ big_p(X5,X6)
| ~ big_q(X5,X6) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X3] :
( ~ big_s(X3)
| big_q(sK1(X3),X3) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X2] : big_p(X2,sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X0] : big_s(X0),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] : big_s(X0),
inference(cnf_transformation,[],[f11]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] : big_p(X0,sK0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( big_q(sK1(X0),X0)
| ~ big_s(X0) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ big_q(X0,X1)
| ~ big_p(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_57,negated_conjecture,
! [X0: $i] : big_q(sK1(X0),X0),
inference(global_subsumption_just,[status(thm)],[c_51,c_49,c_51]) ).
tcf(c_70,plain,
! [X0: $i] : ~ big_q(X0,sK0),
inference(resolution,[status(thm)],[c_50,c_52]) ).
tcf(c_76,plain,
$false,
inference(resolution,[status(thm)],[c_57,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN361+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/15.41 % Computer : n013.cluster.edu
% 0.10/15.41 % Model : x86_64 x86_64
% 0.10/15.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.41 % Memory : 8046.5625MB
% 0.10/15.41 % OS : Linux 6.8.0-71-generic
% 0.10/15.41 % CPULimit : 300
% 0.10/15.41 % WCLimit : 300
% 0.10/15.41 % DateTime : Fri Sep 25 00:58:53 UTC 2026
% 0.10/15.41 % CPUTime :
% 0.10/15.41 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/15.45 Running first-order theorem proving
% 0.10/15.45 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/15.46
% 0.10/15.46 % ======== iProver multi-core TPTP/SMT =========
% 0.10/15.46
% 0.10/15.46 % Detected problem language: tptp
% 0.10/15.47 % Proving...
% 1.04/16.21 % SZS status Started for theBenchmark.p
% 1.04/16.21 % SZS status Theorem for theBenchmark.p
% 1.04/16.21
% 1.04/16.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.04/16.21
% 1.04/16.21 % ------ iProver source info
% 1.04/16.21
% 1.04/16.21 % git: date: 2026-07-19 20:42:38 +0200
% 1.04/16.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.04/16.21 % git: non_committed_changes: false
% 1.04/16.21
% 1.04/16.21 % ------ Parsing...
% 1.04/16.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.04/16.21
% 1.04/16.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s%
% 1.04/16.21
% 1.04/16.21 % SZS status Theorem for theBenchmark.p
% 1.04/16.21
% 1.04/16.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.04/16.21
% 1.04/16.21
%------------------------------------------------------------------------------