%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYO612-1 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 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:51:33 PM UTC 2026
% Result : Unsatisfiable 2.82s 1.28s
% Output : CNFRefutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 153 ( 82 ~; 71 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 10 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 0 sgn 66 !; 0 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : le(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_01) ).
fof(f4,axiom,
! [X0] : eq(f(X0),a0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(f5,axiom,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1)
| ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0)
| ~ eq(f(X0),a0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_05) ).
tcf(c_54,plain,
! [X0: $i] : le(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_57,plain,
! [X0: $i] : eq(f(X0),a0),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0)
| ~ eq(f(X0),a0)
| ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_57,c_58]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X1),a0)
| ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(renaming,[status(thm)],[c_62]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ eq(f(X6),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X2),a0)
| ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_63,c_57]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ le(s(X5),X6)
| ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_68,c_57,c_57,c_57,c_57,c_57]) ).
tcf(c_762,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ~ le(s(X4),X5)
| ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(resolution,[status(thm)],[c_88,c_54]) ).
tcf(c_786,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ le(s(X3),X4)
| ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(resolution,[status(thm)],[c_762,c_54]) ).
tcf(c_895,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ le(s(X2),X3)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(resolution,[status(thm)],[c_786,c_54]) ).
tcf(c_1573,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(resolution,[status(thm)],[c_895,c_54]) ).
tcf(c_1600,plain,
! [X0: $i,X1: $i] : ~ le(s(X0),X1),
inference(resolution,[status(thm)],[c_1573,c_54]) ).
tcf(c_1712,plain,
$false,
inference(resolution,[status(thm)],[c_1600,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO612-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 03:16:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.42
% 0.15/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.42
% 0.15/0.42 % Detected problem language: tptp
% 0.15/0.44 % Proving...
% 2.82/1.28 % SZS status Started for theBenchmark.p
% 2.82/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.82/1.28
% 2.82/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.82/1.28
% 2.82/1.28 % ------ iProver source info
% 2.82/1.28
% 2.82/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.82/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.82/1.28 % git: non_committed_changes: false
% 2.82/1.28
% 2.82/1.28 % ------ Parsing...% successful
% 2.82/1.28
% 2.82/1.28
% 2.82/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.82/1.28
% 2.82/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.82/1.28
% 2.82/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.82/1.28 % ------ Proving...
% 2.82/1.28 % ------ Problem Properties
% 2.82/1.28
% 2.82/1.28 %
% 2.82/1.28 % clauses 4
% 2.82/1.28 % conjectures 0
% 2.82/1.28 % EPR 1
% 2.82/1.28 % Horn 4
% 2.82/1.28 % unary 1
% 2.82/1.28 % binary 2
% 2.82/1.28 % lits 11
% 2.82/1.28 % lits eq 0
% 2.82/1.28 % fd_pure 0
% 2.82/1.28 % fd_pseudo 0
% 2.82/1.28 % fd_cond 0
% 2.82/1.28 % fd_pseudo_cond 0
% 2.82/1.28 % AC symbols 0
% 2.82/1.28
% 2.82/1.28 % ------ Input Options Time Limit: Unbounded
% 2.82/1.28
% 2.82/1.28
% 2.82/1.28 % ------
% 2.82/1.28 % Current options:
% 2.82/1.28 % ------
% 2.82/1.28
% 2.82/1.28
% 2.82/1.28 %
% 2.82/1.28
% 2.82/1.28 % ------ Proving...
% 2.82/1.28 %
% 2.82/1.28
% 2.82/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.82/1.28
% 2.82/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.82/1.28
% 2.82/1.28
%------------------------------------------------------------------------------