TSTP Solution File: GRP664+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP664+1 : TPTP v8.1.2. Released v4.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 : Thu Aug 31 01:01:15 EDT 2023
% Result : CounterSatisfiable 214.86s 28.93s
% Output : Saturation 214.86s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X1] : mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,axiom,
! [X1] : mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X1,mult(X0,X2)) = mult(rd(mult(X1,X0),X1),mult(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
fof(f8,axiom,
! [X2,X0,X1] : mult(mult(X1,X0),X2) = mult(mult(X1,X2),ld(X2,mult(X0,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f9,conjecture,
! [X3,X4,X5,X6] :
( unit = mult(X3,X4)
=> ( mult(mult(X5,X6),mult(X4,X3)) = mult(X5,mult(X6,mult(X4,X3)))
& mult(mult(X5,mult(X4,X3)),X6) = mult(X5,mult(mult(X4,X3),X6))
& mult(mult(X4,X3),mult(X5,X6)) = mult(mult(mult(X4,X3),X5),X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f10,negated_conjecture,
~ ! [X3,X4,X5,X6] :
( unit = mult(X3,X4)
=> ( mult(mult(X5,X6),mult(X4,X3)) = mult(X5,mult(X6,mult(X4,X3)))
& mult(mult(X5,mult(X4,X3)),X6) = mult(X5,mult(mult(X4,X3),X6))
& mult(mult(X4,X3),mult(X5,X6)) = mult(mult(mult(X4,X3),X5),X6) ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f11,plain,
! [X0] : mult(X0,unit) = X0,
inference(rectify,[],[f5]) ).
fof(f12,plain,
! [X0] : mult(unit,X0) = X0,
inference(rectify,[],[f6]) ).
fof(f13,plain,
! [X0,X1,X2] : mult(X2,mult(X1,X0)) = mult(rd(mult(X2,X1),X2),mult(X2,X0)),
inference(rectify,[],[f7]) ).
fof(f14,plain,
! [X0,X1,X2] : mult(mult(X2,X1),X0) = mult(mult(X2,X0),ld(X0,mult(X1,X0))),
inference(rectify,[],[f8]) ).
fof(f15,plain,
~ ! [X0,X1,X2,X3] :
( unit = mult(X0,X1)
=> ( mult(mult(X2,X3),mult(X1,X0)) = mult(X2,mult(X3,mult(X1,X0)))
& mult(mult(X2,mult(X1,X0)),X3) = mult(X2,mult(mult(X1,X0),X3))
& mult(mult(X1,X0),mult(X2,X3)) = mult(mult(mult(X1,X0),X2),X3) ) ),
inference(rectify,[],[f10]) ).
fof(f16,plain,
? [X0,X1,X2,X3] :
( ( mult(mult(X2,X3),mult(X1,X0)) != mult(X2,mult(X3,mult(X1,X0)))
| mult(mult(X2,mult(X1,X0)),X3) != mult(X2,mult(mult(X1,X0),X3))
| mult(mult(X1,X0),mult(X2,X3)) != mult(mult(mult(X1,X0),X2),X3) )
& unit = mult(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ? [X0,X1,X2,X3] :
( ( mult(mult(X2,X3),mult(X1,X0)) != mult(X2,mult(X3,mult(X1,X0)))
| mult(mult(X2,mult(X1,X0)),X3) != mult(X2,mult(mult(X1,X0),X3))
| mult(mult(X1,X0),mult(X2,X3)) != mult(mult(mult(X1,X0),X2),X3) )
& unit = mult(X0,X1) )
=> ( ( mult(mult(sK2,sK3),mult(sK1,sK0)) != mult(sK2,mult(sK3,mult(sK1,sK0)))
| mult(mult(sK2,mult(sK1,sK0)),sK3) != mult(sK2,mult(mult(sK1,sK0),sK3))
| mult(mult(sK1,sK0),mult(sK2,sK3)) != mult(mult(mult(sK1,sK0),sK2),sK3) )
& unit = mult(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ( mult(mult(sK2,sK3),mult(sK1,sK0)) != mult(sK2,mult(sK3,mult(sK1,sK0)))
| mult(mult(sK2,mult(sK1,sK0)),sK3) != mult(sK2,mult(mult(sK1,sK0),sK3))
| mult(mult(sK1,sK0),mult(sK2,sK3)) != mult(mult(mult(sK1,sK0),sK2),sK3) )
& unit = mult(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f16,f17]) ).
fof(f19,plain,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f3]) ).
fof(f22,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f23,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f11]) ).
fof(f24,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X2,X0,X1] : mult(X2,mult(X1,X0)) = mult(rd(mult(X2,X1),X2),mult(X2,X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X2,X0,X1] : mult(mult(X2,X1),X0) = mult(mult(X2,X0),ld(X0,mult(X1,X0))),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
unit = mult(sK0,sK1),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
( mult(mult(sK2,sK3),mult(sK1,sK0)) != mult(sK2,mult(sK3,mult(sK1,sK0)))
| mult(mult(sK2,mult(sK1,sK0)),sK3) != mult(sK2,mult(mult(sK1,sK0),sK3))
| mult(mult(sK1,sK0),mult(sK2,sK3)) != mult(mult(mult(sK1,sK0),sK2),sK3) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_49,plain,
mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f19]) ).
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f20]) ).
cnf(c_51,plain,
mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f21]) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f22]) ).
cnf(c_53,plain,
mult(X0,unit) = X0,
inference(cnf_transformation,[],[f23]) ).
cnf(c_54,plain,
mult(unit,X0) = X0,
inference(cnf_transformation,[],[f24]) ).
cnf(c_55,plain,
mult(rd(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(X1,X2)),
inference(cnf_transformation,[],[f25]) ).
cnf(c_56,plain,
mult(mult(X0,X1),ld(X1,mult(X2,X1))) = mult(mult(X0,X2),X1),
inference(cnf_transformation,[],[f26]) ).
cnf(c_57,negated_conjecture,
( mult(mult(mult(sK1,sK0),sK2),sK3) != mult(mult(sK1,sK0),mult(sK2,sK3))
| mult(mult(sK2,mult(sK1,sK0)),sK3) != mult(sK2,mult(mult(sK1,sK0),sK3))
| mult(mult(sK2,sK3),mult(sK1,sK0)) != mult(sK2,mult(sK3,mult(sK1,sK0))) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_58,negated_conjecture,
mult(sK0,sK1) = unit,
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP664+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 02:27:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 214.86/28.93 % SZS status Started for theBenchmark.p
% 214.86/28.93 % SZS status CounterSatisfiable for theBenchmark.p
% 214.86/28.93
% 214.86/28.93 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 214.86/28.93
% 214.86/28.93 ------ iProver source info
% 214.86/28.93
% 214.86/28.93 git: date: 2023-05-31 18:12:56 +0000
% 214.86/28.93 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 214.86/28.93 git: non_committed_changes: false
% 214.86/28.93 git: last_make_outside_of_git: false
% 214.86/28.93
% 214.86/28.93 ------ Parsing...
% 214.86/28.93 ------ Clausification by vclausify_rel & Parsing by iProver...
% 214.86/28.93
% 214.86/28.93 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 214.86/28.93
% 214.86/28.93 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 214.86/28.93
% 214.86/28.93 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 214.86/28.93 ------ Proving...
% 214.86/28.93 ------ Problem Properties
% 214.86/28.93
% 214.86/28.93
% 214.86/28.93 clauses 10
% 214.86/28.93 conjectures 2
% 214.86/28.93 EPR 0
% 214.86/28.93 Horn 10
% 214.86/28.93 unary 9
% 214.86/28.93 binary 0
% 214.86/28.93 lits 12
% 214.86/28.93 lits eq 12
% 214.86/28.93 fd_pure 0
% 214.86/28.93 fd_pseudo 0
% 214.86/28.93 fd_cond 0
% 214.86/28.93 fd_pseudo_cond 0
% 214.86/28.93 AC symbols 0
% 214.86/28.93
% 214.86/28.93 ------ Input Options Time Limit: Unbounded
% 214.86/28.93
% 214.86/28.93
% 214.86/28.93 ------
% 214.86/28.93 Current options:
% 214.86/28.93 ------
% 214.86/28.93
% 214.86/28.93
% 214.86/28.93
% 214.86/28.93
% 214.86/28.93 ------ Proving...
% 214.86/28.93
% 214.86/28.93
% 214.86/28.93 % SZS status CounterSatisfiable for theBenchmark.p
% 214.86/28.93
% 214.86/28.93 % SZS output start Saturation for theBenchmark.p
% See solution above
% 214.86/28.93
% 214.86/28.93
%------------------------------------------------------------------------------