TSTP Solution File: GRP665+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:16 EDT 2023
% Result : Theorem 3.09s 1.09s
% Output : CNFRefutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 29 unt; 0 def)
% Number of atoms : 68 ( 67 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 59 ( 33 ~; 19 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn; 35 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
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,axiom,
! [X1] : mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
fof(f10,conjecture,
! [X3,X4] :
( mult(mult(X3,X4),op_c) = mult(X3,mult(X4,op_c))
& mult(mult(X3,op_c),X4) = mult(X3,mult(op_c,X4))
& mult(op_c,mult(X3,X4)) = mult(mult(op_c,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f11,negated_conjecture,
~ ! [X3,X4] :
( mult(mult(X3,X4),op_c) = mult(X3,mult(X4,op_c))
& mult(mult(X3,op_c),X4) = mult(X3,mult(op_c,X4))
& mult(op_c,mult(X3,X4)) = mult(mult(op_c,X3),X4) ),
inference(negated_conjecture,[],[f10]) ).
fof(f14,plain,
! [X0,X1,X2] : mult(X2,mult(X1,X0)) = mult(rd(mult(X2,X1),X2),mult(X2,X0)),
inference(rectify,[],[f7]) ).
fof(f15,plain,
! [X0,X1,X2] : mult(mult(X2,X1),X0) = mult(mult(X2,X0),ld(X0,mult(X1,X0))),
inference(rectify,[],[f8]) ).
fof(f16,plain,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
inference(rectify,[],[f9]) ).
fof(f17,plain,
~ ! [X0,X1] :
( mult(mult(X0,X1),op_c) = mult(X0,mult(X1,op_c))
& mult(mult(X0,op_c),X1) = mult(X0,mult(op_c,X1))
& mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1) ),
inference(rectify,[],[f11]) ).
fof(f18,plain,
? [X0,X1] :
( mult(mult(X0,X1),op_c) != mult(X0,mult(X1,op_c))
| mult(mult(X0,op_c),X1) != mult(X0,mult(op_c,X1))
| mult(op_c,mult(X0,X1)) != mult(mult(op_c,X0),X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f19,plain,
( ? [X0,X1] :
( mult(mult(X0,X1),op_c) != mult(X0,mult(X1,op_c))
| mult(mult(X0,op_c),X1) != mult(X0,mult(op_c,X1))
| mult(op_c,mult(X0,X1)) != mult(mult(op_c,X0),X1) )
=> ( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f19]) ).
fof(f22,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f24,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f27,plain,
! [X2,X0,X1] : mult(X2,mult(X1,X0)) = mult(rd(mult(X2,X1),X2),mult(X2,X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X2,X0,X1] : mult(mult(X2,X1),X0) = mult(mult(X2,X0),ld(X0,mult(X1,X0))),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
( mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = 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,[],[f27]) ).
cnf(c_56,plain,
mult(mult(X0,X1),ld(X1,mult(X2,X1))) = mult(mult(X0,X2),X1),
inference(cnf_transformation,[],[f28]) ).
cnf(c_57,plain,
mult(X0,op_c) = mult(op_c,X0),
inference(cnf_transformation,[],[f29]) ).
cnf(c_58,negated_conjecture,
( mult(mult(op_c,sK0),sK1) != mult(op_c,mult(sK0,sK1))
| mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
| mult(mult(sK0,sK1),op_c) != mult(sK0,mult(sK1,op_c)) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_92,plain,
( mult(mult(op_c,sK0),sK1) != mult(op_c,mult(sK0,sK1))
| mult(mult(op_c,sK0),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(sK0,mult(op_c,sK1)) ),
inference(demodulation,[status(thm)],[c_58,c_57]) ).
cnf(c_102,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_143,plain,
( mult(mult(op_c,sK0),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(sK0,mult(op_c,sK1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_92,c_102]) ).
cnf(c_154,plain,
( mult(mult(op_c,sK0),sK1) != mult(sK0,mult(op_c,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(sK0,mult(op_c,sK1)) ),
inference(global_subsumption_just,[status(thm)],[c_92,c_143]) ).
cnf(c_182,plain,
rd(mult(op_c,X0),op_c) = X0,
inference(superposition,[status(thm)],[c_57,c_52]) ).
cnf(c_183,plain,
ld(X0,mult(op_c,X0)) = op_c,
inference(superposition,[status(thm)],[c_57,c_50]) ).
cnf(c_201,plain,
mult(rd(mult(op_c,X0),op_c),mult(X1,op_c)) = mult(op_c,mult(X0,X1)),
inference(superposition,[status(thm)],[c_57,c_55]) ).
cnf(c_210,plain,
mult(X0,mult(X1,op_c)) = mult(op_c,mult(X0,X1)),
inference(light_normalisation,[status(thm)],[c_201,c_182]) ).
cnf(c_336,plain,
mult(mult(X0,X1),op_c) = mult(mult(X0,op_c),X1),
inference(superposition,[status(thm)],[c_183,c_56]) ).
cnf(c_451,plain,
mult(X0,mult(op_c,X1)) = mult(op_c,mult(X0,X1)),
inference(superposition,[status(thm)],[c_57,c_210]) ).
cnf(c_479,plain,
( mult(mult(op_c,sK0),sK1) != mult(op_c,mult(sK0,sK1))
| mult(op_c,mult(sK0,sK1)) != mult(op_c,mult(sK0,sK1)) ),
inference(demodulation,[status(thm)],[c_154,c_451]) ).
cnf(c_480,plain,
mult(mult(op_c,sK0),sK1) != mult(op_c,mult(sK0,sK1)),
inference(equality_resolution_simp,[status(thm)],[c_479]) ).
cnf(c_513,plain,
mult(mult(X0,op_c),X1) = mult(op_c,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_336,c_57]) ).
cnf(c_520,plain,
mult(mult(op_c,X0),X1) = mult(op_c,mult(X0,X1)),
inference(superposition,[status(thm)],[c_57,c_513]) ).
cnf(c_650,plain,
mult(op_c,mult(sK0,sK1)) != mult(op_c,mult(sK0,sK1)),
inference(demodulation,[status(thm)],[c_480,c_520]) ).
cnf(c_651,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_650]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n014.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Aug 28 23:49:00 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.09/1.09 % SZS status Started for theBenchmark.p
% 3.09/1.09 % SZS status Theorem for theBenchmark.p
% 3.09/1.09
% 3.09/1.09 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.09/1.09
% 3.09/1.09 ------ iProver source info
% 3.09/1.09
% 3.09/1.09 git: date: 2023-05-31 18:12:56 +0000
% 3.09/1.09 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.09/1.09 git: non_committed_changes: false
% 3.09/1.09 git: last_make_outside_of_git: false
% 3.09/1.09
% 3.09/1.09 ------ Parsing...
% 3.09/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.09/1.09
% 3.09/1.09 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.09/1.09
% 3.09/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.09/1.09
% 3.09/1.09 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.09/1.09 ------ Proving...
% 3.09/1.09 ------ Problem Properties
% 3.09/1.09
% 3.09/1.09
% 3.09/1.09 clauses 10
% 3.09/1.09 conjectures 0
% 3.09/1.09 EPR 0
% 3.09/1.09 Horn 10
% 3.09/1.09 unary 9
% 3.09/1.09 binary 0
% 3.09/1.09 lits 12
% 3.09/1.09 lits eq 12
% 3.09/1.09 fd_pure 0
% 3.09/1.09 fd_pseudo 0
% 3.09/1.09 fd_cond 0
% 3.09/1.09 fd_pseudo_cond 0
% 3.09/1.09 AC symbols 0
% 3.09/1.09
% 3.09/1.09 ------ Schedule dynamic 5 is on
% 3.09/1.09
% 3.09/1.09 ------ no conjectures: strip conj schedule
% 3.09/1.09
% 3.09/1.09 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.09/1.09
% 3.09/1.09
% 3.09/1.09 ------
% 3.09/1.09 Current options:
% 3.09/1.09 ------
% 3.09/1.09
% 3.09/1.09
% 3.09/1.09
% 3.09/1.09
% 3.09/1.09 ------ Proving...
% 3.09/1.09
% 3.09/1.09
% 3.09/1.09 % SZS status Theorem for theBenchmark.p
% 3.09/1.09
% 3.09/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.09/1.09
% 3.09/1.09
%------------------------------------------------------------------------------