TSTP Solution File: RNG006-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : RNG006-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 02:57:12 EDT 2024
% Result : Unsatisfiable 3.47s 1.19s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 6 unt; 0 nHn; 14 RR)
% Number of literals : 37 ( 0 equ; 24 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_70,plain,
( ~ sum(X0,X1,X2)
| ~ sum(X3,X4,X5)
| ~ product(X6,X0,X3)
| ~ product(X6,X1,X4)
| product(X6,X2,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity2) ).
cnf(c_77,plain,
( ~ product(X0,X1,X2)
| product(X0,additive_inverse(X1),additive_inverse(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_lemma1) ).
cnf(c_80,plain,
sum(b,additive_inverse(c),bS_Ic),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_plus_inverse_c) ).
cnf(c_81,plain,
product(a,b,aPb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b) ).
cnf(c_82,plain,
product(a,c,aPc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c) ).
cnf(c_83,plain,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aPb_plus_IaPc) ).
cnf(c_84,negated_conjecture,
~ product(a,bS_Ic,aPb_S_IaPc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_times_bS_Ic_is_aPb_S__IaPc) ).
cnf(c_284,plain,
( ~ sum(X0,X1,bS_Ic)
| ~ sum(X2,X3,aPb_S_IaPc)
| ~ product(a,X0,X2)
| ~ product(a,X1,X3)
| product(a,bS_Ic,aPb_S_IaPc) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_342,plain,
( ~ product(a,additive_inverse(c),X0)
| ~ sum(b,additive_inverse(c),bS_Ic)
| ~ sum(X1,X0,aPb_S_IaPc)
| ~ product(a,b,X1)
| product(a,bS_Ic,aPb_S_IaPc) ),
inference(instantiation,[status(thm)],[c_284]) ).
cnf(c_465,plain,
( ~ product(a,additive_inverse(c),X0)
| ~ sum(b,additive_inverse(c),bS_Ic)
| ~ sum(aPb,X0,aPb_S_IaPc)
| ~ product(a,b,aPb)
| product(a,bS_Ic,aPb_S_IaPc) ),
inference(instantiation,[status(thm)],[c_342]) ).
cnf(c_1146,plain,
( ~ product(a,c,X0)
| product(a,additive_inverse(c),additive_inverse(X0)) ),
inference(instantiation,[status(thm)],[c_77]) ).
cnf(c_1179,plain,
( ~ product(a,additive_inverse(c),additive_inverse(aPc))
| ~ sum(b,additive_inverse(c),bS_Ic)
| ~ sum(aPb,additive_inverse(aPc),aPb_S_IaPc)
| ~ product(a,b,aPb)
| product(a,bS_Ic,aPb_S_IaPc) ),
inference(instantiation,[status(thm)],[c_465]) ).
cnf(c_6258,plain,
( ~ product(a,c,aPc)
| product(a,additive_inverse(c),additive_inverse(aPc)) ),
inference(instantiation,[status(thm)],[c_1146]) ).
cnf(c_6259,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6258,c_1179,c_80,c_83,c_84,c_81,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG006-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 2 21:23:14 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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
% 3.47/1.19 % SZS status Started for theBenchmark.p
% 3.47/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.47/1.19
% 3.47/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.47/1.19
% 3.47/1.19 ------ iProver source info
% 3.47/1.19
% 3.47/1.19 git: date: 2024-05-02 19:28:25 +0000
% 3.47/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.47/1.19 git: non_committed_changes: false
% 3.47/1.19
% 3.47/1.19 ------ Parsing...successful
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.47/1.19
% 3.47/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.47/1.19 ------ Proving...
% 3.47/1.19 ------ Problem Properties
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19 clauses 36
% 3.47/1.19 conjectures 1
% 3.47/1.19 EPR 24
% 3.47/1.19 Horn 36
% 3.47/1.19 unary 13
% 3.47/1.19 binary 7
% 3.47/1.19 lits 87
% 3.47/1.19 lits eq 0
% 3.47/1.19 fd_pure 0
% 3.47/1.19 fd_pseudo 0
% 3.47/1.19 fd_cond 0
% 3.47/1.19 fd_pseudo_cond 0
% 3.47/1.19 AC symbols 0
% 3.47/1.19
% 3.47/1.19 ------ Schedule dynamic 5 is on
% 3.47/1.19
% 3.47/1.19 ------ no equalities: superposition off
% 3.47/1.19
% 3.47/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19 ------
% 3.47/1.19 Current options:
% 3.47/1.19 ------
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19 ------ Proving...
% 3.47/1.19
% 3.47/1.19
% 3.47/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.47/1.19
% 3.47/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.47/1.19
% 3.47/1.19
%------------------------------------------------------------------------------