TSTP Solution File: SYO612-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO612-1 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:38:29 EDT 2024
% Result : Unsatisfiable 2.88s 1.11s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 4 unt; 0 nHn; 11 RR)
% Number of literals : 72 ( 0 equ; 69 neg)
% Maximal clause size : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 : 57 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
le(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
cnf(c_52,plain,
eq(f(X0),a0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
cnf(c_53,plain,
( ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ eq(f(X0),a0)
| ~ eq(f(X1),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
cnf(c_57,plain,
( ~ 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(X1),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0) ),
inference(global_subsumption_just,[status(thm)],[c_53,c_52,c_53]) ).
cnf(c_58,plain,
( ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ eq(f(X1),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0) ),
inference(renaming,[status(thm)],[c_57]) ).
cnf(c_63,plain,
( ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ eq(f(X2),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_58,c_52]) ).
cnf(c_83,plain,
( ~ 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(forward_subsumption_resolution,[status(thm)],[c_63,c_52,c_52,c_52,c_52,c_52]) ).
cnf(c_757,plain,
( ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5) ),
inference(resolution,[status(thm)],[c_83,c_49]) ).
cnf(c_781,plain,
( ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4) ),
inference(resolution,[status(thm)],[c_757,c_49]) ).
cnf(c_890,plain,
( ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3) ),
inference(resolution,[status(thm)],[c_781,c_49]) ).
cnf(c_1568,plain,
( ~ le(s(X0),X1)
| ~ le(s(X1),X2) ),
inference(resolution,[status(thm)],[c_890,c_49]) ).
cnf(c_1595,plain,
~ le(s(X0),X1),
inference(resolution,[status(thm)],[c_1568,c_49]) ).
cnf(c_1707,plain,
$false,
inference(resolution,[status(thm)],[c_1595,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO612-1 : TPTP v8.1.2. Released v7.1.0.
% 0.09/0.12 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n022.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 19:59:57 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.88/1.11 % SZS status Started for theBenchmark.p
% 2.88/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.88/1.11
% 2.88/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.88/1.11
% 2.88/1.11 ------ iProver source info
% 2.88/1.11
% 2.88/1.11 git: date: 2024-05-02 19:28:25 +0000
% 2.88/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.88/1.11 git: non_committed_changes: false
% 2.88/1.11
% 2.88/1.11 ------ Parsing...successful
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 2.88/1.11
% 2.88/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.88/1.11 ------ Proving...
% 2.88/1.11 ------ Problem Properties
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11 clauses 4
% 2.88/1.11 conjectures 0
% 2.88/1.11 EPR 1
% 2.88/1.11 Horn 4
% 2.88/1.11 unary 1
% 2.88/1.11 binary 2
% 2.88/1.11 lits 11
% 2.88/1.11 lits eq 0
% 2.88/1.11 fd_pure 0
% 2.88/1.11 fd_pseudo 0
% 2.88/1.11 fd_cond 0
% 2.88/1.11 fd_pseudo_cond 0
% 2.88/1.11 AC symbols 0
% 2.88/1.11
% 2.88/1.11 ------ Input Options Time Limit: Unbounded
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11 ------
% 2.88/1.11 Current options:
% 2.88/1.11 ------
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11 ------ Proving...
% 2.88/1.11
% 2.88/1.11
% 2.88/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.88/1.11
% 2.88/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.88/1.11
% 2.88/1.11
%------------------------------------------------------------------------------