TSTP Solution File: GRP710+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP710+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 01:01:33 EDT 2023
% Result : Theorem 0.49s 1.18s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 38 unt; 0 def)
% Number of atoms : 74 ( 61 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 51 ( 33 ~; 13 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 114 ( 12 sgn; 39 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X1,X2,X0] : mult(X0,mult(X2,mult(X2,X1))) = mult(mult(mult(X0,X2),X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0] : unit = mult(X0,i(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X0] : unit = mult(i(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,conjecture,
( ! [X6,X7] :
? [X8] : mult(X8,X7) = X6
& ! [X3,X4] :
? [X5] : mult(X3,X5) = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f7,negated_conjecture,
~ ( ! [X6,X7] :
? [X8] : mult(X8,X7) = X6
& ! [X3,X4] :
? [X5] : mult(X3,X5) = X4 ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,plain,
! [X0,X1,X2] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
inference(rectify,[],[f3]) ).
fof(f9,plain,
~ ( ! [X0,X1] :
? [X2] : mult(X2,X1) = X0
& ! [X3,X4] :
? [X5] : mult(X3,X5) = X4 ),
inference(rectify,[],[f7]) ).
fof(f10,plain,
( ? [X0,X1] :
! [X2] : mult(X2,X1) != X0
| ? [X3,X4] :
! [X5] : mult(X3,X5) != X4 ),
inference(ennf_transformation,[],[f9]) ).
fof(f11,plain,
( ? [X0,X1] :
! [X2] : mult(X2,X1) != X0
=> ! [X2] : sK0 != mult(X2,sK1) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X3,X4] :
! [X5] : mult(X3,X5) != X4
=> ! [X5] : sK3 != mult(sK2,X5) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ! [X2] : sK0 != mult(X2,sK1)
| ! [X5] : sK3 != mult(sK2,X5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f10,f12,f11]) ).
fof(f14,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f16,plain,
! [X2,X0,X1] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f18,plain,
! [X0] : unit = mult(i(X0),X0),
inference(cnf_transformation,[],[f5]) ).
fof(f19,plain,
! [X2,X5] :
( sK0 != mult(X2,sK1)
| sK3 != mult(sK2,X5) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_49,plain,
mult(X0,unit) = X0,
inference(cnf_transformation,[],[f14]) ).
cnf(c_50,plain,
mult(unit,X0) = X0,
inference(cnf_transformation,[],[f15]) ).
cnf(c_51,plain,
mult(mult(mult(X0,X1),X1),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(cnf_transformation,[],[f16]) ).
cnf(c_52,plain,
mult(X0,i(X0)) = unit,
inference(cnf_transformation,[],[f17]) ).
cnf(c_53,plain,
mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f18]) ).
cnf(c_54,negated_conjecture,
( mult(X0,sK1) != sK0
| mult(sK2,X1) != sK3 ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_79,negated_conjecture,
( mult(sK2,X0) != sK3
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_54]) ).
cnf(c_80,negated_conjecture,
( mult(X0,sK1) != sK0
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_54]) ).
cnf(c_81,negated_conjecture,
( sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_54]) ).
cnf(c_168,plain,
mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(mult(unit,i(X0)),X1),
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_169,plain,
mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_170,plain,
mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_171,plain,
mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(mult(X0,X1),X1),mult(X2,mult(X2,X3))),
inference(superposition,[status(thm)],[c_51,c_51]) ).
cnf(c_178,plain,
mult(i(X0),mult(X0,mult(X0,X1))) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_169,c_50]) ).
cnf(c_898,plain,
mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(i(X0),X1),
inference(demodulation,[status(thm)],[c_168,c_50]) ).
cnf(c_913,plain,
( mult(i(sK2),X0) != sK3
| ~ sP0_iProver_split ),
inference(superposition,[status(thm)],[c_898,c_79]) ).
cnf(c_1385,plain,
mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(demodulation,[status(thm)],[c_170,c_49]) ).
cnf(c_1386,plain,
mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(demodulation,[status(thm)],[c_51,c_1385]) ).
cnf(c_1392,plain,
mult(i(X0),mult(X0,X0)) = mult(unit,X0),
inference(superposition,[status(thm)],[c_53,c_1385]) ).
cnf(c_1404,plain,
( mult(X0,mult(sK1,sK1)) != sK0
| ~ sP1_iProver_split ),
inference(superposition,[status(thm)],[c_1385,c_80]) ).
cnf(c_1424,plain,
mult(i(X0),mult(X0,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1392,c_50]) ).
cnf(c_1791,plain,
mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(X0,mult(X1,X1)),mult(X2,mult(X2,X3))),
inference(light_normalisation,[status(thm)],[c_171,c_1385]) ).
cnf(c_1792,plain,
mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,X3))))),
inference(demodulation,[status(thm)],[c_1791,c_1386]) ).
cnf(c_1880,plain,
( mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,mult(sK1,sK1)))))) != sK0
| ~ sP1_iProver_split ),
inference(superposition,[status(thm)],[c_1792,c_1404]) ).
cnf(c_2336,plain,
mult(X0,mult(i(X0),mult(X0,X1))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_178,c_898]) ).
cnf(c_2484,plain,
( mult(X0,mult(X1,mult(X1,mult(sK1,sK1)))) != sK0
| ~ sP1_iProver_split ),
inference(superposition,[status(thm)],[c_50,c_1880]) ).
cnf(c_4386,plain,
( mult(X0,mult(i(sK1),sK1)) != sK0
| ~ sP1_iProver_split ),
inference(superposition,[status(thm)],[c_1424,c_2484]) ).
cnf(c_4547,plain,
( X0 != sK0
| ~ sP1_iProver_split ),
inference(demodulation,[status(thm)],[c_4386,c_49,c_53]) ).
cnf(c_4552,plain,
~ sP1_iProver_split,
inference(equality_resolution,[status(thm)],[c_4547]) ).
cnf(c_4553,plain,
sP0_iProver_split,
inference(backward_subsumption_resolution,[status(thm)],[c_81,c_4552]) ).
cnf(c_4555,plain,
mult(i(sK2),X0) != sK3,
inference(backward_subsumption_resolution,[status(thm)],[c_913,c_4553]) ).
cnf(c_4743,plain,
mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(unit,X1),
inference(superposition,[status(thm)],[c_53,c_1386]) ).
cnf(c_5028,plain,
mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
inference(demodulation,[status(thm)],[c_4743,c_50]) ).
cnf(c_5054,plain,
mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(i(X0),mult(X0,X1)),
inference(superposition,[status(thm)],[c_2336,c_5028]) ).
cnf(c_5073,plain,
mult(i(X0),mult(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_5054,c_5028]) ).
cnf(c_5246,plain,
X0 != sK3,
inference(superposition,[status(thm)],[c_5073,c_4555]) ).
cnf(c_5278,plain,
$false,
inference(equality_resolution,[status(thm)],[c_5246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP710+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n017.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 22:19:58 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.49/1.18 % SZS status Started for theBenchmark.p
% 0.49/1.18 % SZS status Theorem for theBenchmark.p
% 0.49/1.18
% 0.49/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.49/1.18
% 0.49/1.18 ------ iProver source info
% 0.49/1.18
% 0.49/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.49/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.49/1.18 git: non_committed_changes: false
% 0.49/1.18 git: last_make_outside_of_git: false
% 0.49/1.18
% 0.49/1.18 ------ Parsing...
% 0.49/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.49/1.18
% 0.49/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.49/1.18 ------ Proving...
% 0.49/1.18 ------ Problem Properties
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 clauses 8
% 0.49/1.18 conjectures 3
% 0.49/1.18 EPR 1
% 0.49/1.18 Horn 7
% 0.49/1.18 unary 5
% 0.49/1.18 binary 3
% 0.49/1.18 lits 11
% 0.49/1.18 lits eq 7
% 0.49/1.18 fd_pure 0
% 0.49/1.18 fd_pseudo 0
% 0.49/1.18 fd_cond 0
% 0.49/1.18 fd_pseudo_cond 0
% 0.49/1.18 AC symbols 0
% 0.49/1.18
% 0.49/1.18 ------ Schedule dynamic 5 is on
% 0.49/1.18
% 0.49/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 ------
% 0.49/1.18 Current options:
% 0.49/1.18 ------
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 ------ Proving...
% 0.49/1.18
% 0.49/1.18
% 0.49/1.18 % SZS status Theorem for theBenchmark.p
% 0.49/1.18
% 0.49/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.18
% 0.49/1.19
%------------------------------------------------------------------------------