TSTP Solution File: GRP028-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP028-3 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 : Thu Aug 31 00:56:42 EDT 2023
% Result : Unsatisfiable 2.25s 1.16s
% Output : CNFRefutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 28 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_51,plain,
( ~ product(X0,X1,X2)
| ~ product(X0,X3,X4)
| ~ product(X1,X5,X3)
| product(X2,X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity2) ).
cnf(c_52,plain,
product(left_solution(X0,X1),X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_soln) ).
cnf(c_53,plain,
product(X0,right_solution(X0,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_soln) ).
cnf(c_54,negated_conjecture,
~ product(not_identity(X0),X0,not_identity(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_right_identity) ).
cnf(c_55,plain,
product(iProver_bot,right_solution(iProver_bot,iProver_bot),iProver_bot),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_88,plain,
( ~ product(left_solution(X0,X1),X0,X1)
| ~ product(left_solution(X0,X1),X2,X3)
| ~ product(X0,X4,X2)
| product(X1,X4,X3) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_116,plain,
( ~ product(left_solution(X0,X1),X0,X1)
| ~ product(left_solution(X0,X1),X2,X3)
| ~ product(X0,right_solution(X0,X2),X2)
| product(X1,right_solution(X0,X2),X3) ),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_306,plain,
( ~ product(left_solution(X0,not_identity(right_solution(X0,X1))),X0,not_identity(right_solution(X0,X1)))
| ~ product(left_solution(X0,not_identity(right_solution(X0,X1))),X1,not_identity(right_solution(X0,X1)))
| ~ product(X0,right_solution(X0,X1),X1)
| product(not_identity(right_solution(X0,X1)),right_solution(X0,X1),not_identity(right_solution(X0,X1))) ),
inference(instantiation,[status(thm)],[c_116]) ).
cnf(c_307,plain,
~ product(not_identity(right_solution(X0,X1)),right_solution(X0,X1),not_identity(right_solution(X0,X1))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_308,plain,
( ~ product(left_solution(iProver_bot,not_identity(right_solution(iProver_bot,iProver_bot))),iProver_bot,not_identity(right_solution(iProver_bot,iProver_bot)))
| ~ product(iProver_bot,right_solution(iProver_bot,iProver_bot),iProver_bot)
| product(not_identity(right_solution(iProver_bot,iProver_bot)),right_solution(iProver_bot,iProver_bot),not_identity(right_solution(iProver_bot,iProver_bot))) ),
inference(instantiation,[status(thm)],[c_306]) ).
cnf(c_309,plain,
~ product(not_identity(right_solution(iProver_bot,iProver_bot)),right_solution(iProver_bot,iProver_bot),not_identity(right_solution(iProver_bot,iProver_bot))),
inference(instantiation,[status(thm)],[c_307]) ).
cnf(c_670,plain,
product(left_solution(X0,not_identity(right_solution(X0,X1))),X0,not_identity(right_solution(X0,X1))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_671,plain,
product(left_solution(iProver_bot,not_identity(right_solution(iProver_bot,iProver_bot))),iProver_bot,not_identity(right_solution(iProver_bot,iProver_bot))),
inference(instantiation,[status(thm)],[c_670]) ).
cnf(c_672,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_671,c_309,c_308,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP028-3 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 20:04:05 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.25/1.16 % SZS status Started for theBenchmark.p
% 2.25/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.25/1.16
% 2.25/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.25/1.16
% 2.25/1.16 ------ iProver source info
% 2.25/1.16
% 2.25/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.25/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.25/1.16 git: non_committed_changes: false
% 2.25/1.16 git: last_make_outside_of_git: false
% 2.25/1.16
% 2.25/1.16 ------ Parsing...successful
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.25/1.16
% 2.25/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.25/1.16 ------ Proving...
% 2.25/1.16 ------ Problem Properties
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16 clauses 6
% 2.25/1.16 conjectures 1
% 2.25/1.16 EPR 2
% 2.25/1.16 Horn 6
% 2.25/1.16 unary 4
% 2.25/1.16 binary 0
% 2.25/1.16 lits 12
% 2.25/1.16 lits eq 0
% 2.25/1.16 fd_pure 0
% 2.25/1.16 fd_pseudo 0
% 2.25/1.16 fd_cond 0
% 2.25/1.16 fd_pseudo_cond 0
% 2.25/1.16 AC symbols 0
% 2.25/1.16
% 2.25/1.16 ------ Schedule dynamic 5 is on
% 2.25/1.16
% 2.25/1.16 ------ no equalities: superposition off
% 2.25/1.16
% 2.25/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16 ------
% 2.25/1.16 Current options:
% 2.25/1.16 ------
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16 ------ Proving...
% 2.25/1.16
% 2.25/1.16
% 2.25/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.25/1.16
% 2.25/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.25/1.16
% 2.25/1.16
%------------------------------------------------------------------------------