TSTP Solution File: GRP659+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP659+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:23:20 EDT 2024
% Result : Theorem 8.30s 1.68s
% Output : CNFRefutation 8.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 7
% Syntax : Number of formulae : 68 ( 59 unt; 0 def)
% Number of atoms : 79 ( 78 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 29 ( 18 ~; 7 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-2 aty)
% Number of variables : 136 ( 0 sgn 32 !; 5 ?)
% 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,
! [X2,X0,X1] : mult(mult(X1,mult(X0,X2)),X0) = mult(mult(X1,X0),mult(X2,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,conjecture,
? [X3] :
! [X4] :
( mult(X3,X4) = X4
& mult(X4,X3) = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f7,negated_conjecture,
~ ? [X3] :
! [X4] :
( mult(X3,X4) = X4
& mult(X4,X3) = X4 ),
inference(negated_conjecture,[],[f6]) ).
fof(f8,plain,
! [X0,X1,X2] : mult(mult(X2,mult(X1,X0)),X1) = mult(mult(X2,X1),mult(X0,X1)),
inference(rectify,[],[f5]) ).
fof(f9,plain,
~ ? [X0] :
! [X1] :
( mult(X0,X1) = X1
& mult(X1,X0) = X1 ),
inference(rectify,[],[f7]) ).
fof(f10,plain,
! [X0] :
? [X1] :
( mult(X0,X1) != X1
| mult(X1,X0) != X1 ),
inference(ennf_transformation,[],[f9]) ).
fof(f11,plain,
! [X0] :
( ? [X1] :
( mult(X0,X1) != X1
| mult(X1,X0) != X1 )
=> ( sK0(X0) != mult(X0,sK0(X0))
| sK0(X0) != mult(sK0(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X0] :
( sK0(X0) != mult(X0,sK0(X0))
| sK0(X0) != mult(sK0(X0),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f11]) ).
fof(f13,plain,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f3]) ).
fof(f16,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f17,plain,
! [X2,X0,X1] : mult(mult(X2,mult(X1,X0)),X1) = mult(mult(X2,X1),mult(X0,X1)),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0] :
( sK0(X0) != mult(X0,sK0(X0))
| sK0(X0) != mult(sK0(X0),X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_49,plain,
mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,plain,
mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f15]) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f16]) ).
cnf(c_53,plain,
mult(mult(X0,mult(X1,X2)),X1) = mult(mult(X0,X1),mult(X2,X1)),
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,negated_conjecture,
( mult(sK0(X0),X0) != sK0(X0)
| mult(X0,sK0(X0)) != sK0(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_82,negated_conjecture,
( mult(sK0(X0),X0) != sK0(X0)
| mult(X0,sK0(X0)) != sK0(X0) ),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_130,plain,
ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_132,plain,
rd(X0,ld(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_138,plain,
mult(mult(rd(X0,mult(X1,X2)),X1),mult(X2,X1)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_51,c_53]) ).
cnf(c_140,plain,
mult(mult(X0,X1),mult(ld(X1,X2),X1)) = mult(mult(X0,X2),X1),
inference(superposition,[status(thm)],[c_49,c_53]) ).
cnf(c_160,plain,
mult(mult(rd(X0,mult(X1,rd(X2,X1))),X1),X2) = mult(X0,X1),
inference(superposition,[status(thm)],[c_51,c_138]) ).
cnf(c_163,plain,
mult(rd(X0,mult(X1,X2)),X1) = rd(mult(X0,X1),mult(X2,X1)),
inference(superposition,[status(thm)],[c_138,c_52]) ).
cnf(c_214,plain,
mult(mult(rd(X0,X1),X2),X1) = mult(X0,mult(ld(X1,X2),X1)),
inference(superposition,[status(thm)],[c_51,c_140]) ).
cnf(c_222,plain,
ld(mult(X0,X1),mult(mult(X0,X2),X1)) = mult(ld(X1,X2),X1),
inference(superposition,[status(thm)],[c_140,c_50]) ).
cnf(c_397,plain,
mult(rd(X0,mult(X1,rd(X2,X1))),X1) = rd(mult(X0,X1),X2),
inference(superposition,[status(thm)],[c_160,c_52]) ).
cnf(c_540,plain,
mult(X0,mult(ld(X1,X1),X1)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_51,c_214]) ).
cnf(c_631,plain,
ld(X0,mult(X0,X1)) = mult(ld(X1,X1),X1),
inference(superposition,[status(thm)],[c_540,c_50]) ).
cnf(c_650,plain,
mult(ld(X0,X0),X0) = X0,
inference(light_normalisation,[status(thm)],[c_631,c_50]) ).
cnf(c_713,plain,
ld(X0,X0) = rd(X0,X0),
inference(superposition,[status(thm)],[c_650,c_52]) ).
cnf(c_790,plain,
ld(mult(X0,X1),mult(X0,X1)) = mult(rd(X0,mult(X1,X0)),X1),
inference(superposition,[status(thm)],[c_713,c_163]) ).
cnf(c_916,plain,
ld(mult(X0,X1),mult(X2,X1)) = mult(ld(X1,ld(X0,X2)),X1),
inference(superposition,[status(thm)],[c_49,c_222]) ).
cnf(c_2909,plain,
mult(ld(X0,ld(X1,ld(X0,X0))),X0) = ld(mult(X1,X0),X0),
inference(superposition,[status(thm)],[c_650,c_916]) ).
cnf(c_3348,plain,
mult(ld(X0,ld(X1,X1)),X0) = mult(rd(X1,mult(X0,X1)),X0),
inference(demodulation,[status(thm)],[c_790,c_916]) ).
cnf(c_3378,plain,
rd(mult(ld(X0,ld(X1,X1)),X0),X0) = rd(X1,mult(X0,X1)),
inference(superposition,[status(thm)],[c_3348,c_52]) ).
cnf(c_7304,plain,
ld(X0,ld(X1,X1)) = rd(X1,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_3378,c_52]) ).
cnf(c_7318,plain,
ld(rd(X0,X1),ld(X1,X1)) = rd(X1,X0),
inference(superposition,[status(thm)],[c_51,c_7304]) ).
cnf(c_7329,plain,
ld(ld(X0,X0),ld(X0,X0)) = rd(X0,X0),
inference(superposition,[status(thm)],[c_650,c_7304]) ).
cnf(c_7343,plain,
ld(ld(X0,ld(X1,X1)),X1) = mult(X0,X1),
inference(superposition,[status(thm)],[c_7304,c_130]) ).
cnf(c_7364,plain,
ld(ld(X0,X0),ld(X0,X0)) = ld(X0,X0),
inference(light_normalisation,[status(thm)],[c_7329,c_713]) ).
cnf(c_7572,plain,
rd(ld(X0,X0),rd(X0,X1)) = rd(X1,X0),
inference(superposition,[status(thm)],[c_7318,c_132]) ).
cnf(c_7577,plain,
ld(mult(rd(X0,X1),X1),X1) = mult(ld(X1,rd(X1,X0)),X1),
inference(superposition,[status(thm)],[c_7318,c_2909]) ).
cnf(c_7578,plain,
mult(ld(X0,rd(X0,X1)),X0) = ld(X1,X0),
inference(light_normalisation,[status(thm)],[c_7577,c_51]) ).
cnf(c_7593,plain,
mult(rd(ld(X0,X0),X1),X0) = ld(X1,X0),
inference(superposition,[status(thm)],[c_130,c_7343]) ).
cnf(c_8373,plain,
rd(ld(X0,X0),X1) = rd(ld(X1,X0),X0),
inference(superposition,[status(thm)],[c_132,c_7572]) ).
cnf(c_8573,plain,
ld(X0,rd(X0,X1)) = rd(ld(X1,X0),X0),
inference(superposition,[status(thm)],[c_7578,c_52]) ).
cnf(c_8842,plain,
ld(mult(X0,rd(X1,X0)),X0) = rd(mult(ld(X0,X0),X0),X1),
inference(superposition,[status(thm)],[c_7593,c_397]) ).
cnf(c_8850,plain,
ld(mult(X0,rd(X1,X0)),X0) = rd(X0,X1),
inference(light_normalisation,[status(thm)],[c_8842,c_650]) ).
cnf(c_10248,plain,
ld(X0,rd(X0,X1)) = rd(ld(X0,X0),X1),
inference(light_normalisation,[status(thm)],[c_8373,c_8573]) ).
cnf(c_11338,plain,
ld(mult(X0,X1),X0) = rd(X0,mult(X1,X0)),
inference(superposition,[status(thm)],[c_52,c_8850]) ).
cnf(c_12978,plain,
ld(mult(X0,X1),X0) = ld(X1,ld(X0,X0)),
inference(demodulation,[status(thm)],[c_11338,c_7304]) ).
cnf(c_13019,plain,
rd(X0,ld(X1,ld(X0,X0))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_12978,c_132]) ).
cnf(c_14475,plain,
ld(X0,rd(X0,ld(X1,ld(ld(X0,X0),ld(X0,X0))))) = mult(ld(X0,X0),X1),
inference(superposition,[status(thm)],[c_13019,c_10248]) ).
cnf(c_14488,plain,
mult(ld(X0,X0),X1) = X1,
inference(light_normalisation,[status(thm)],[c_14475,c_50,c_7364,c_13019]) ).
cnf(c_14565,plain,
ld(X0,X0) = rd(X1,X1),
inference(superposition,[status(thm)],[c_14488,c_52]) ).
cnf(c_14865,plain,
mult(X0,rd(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_14565,c_49]) ).
cnf(c_14878,plain,
mult(rd(X0,X0),X1) = X1,
inference(superposition,[status(thm)],[c_14565,c_14488]) ).
cnf(c_15146,plain,
mult(rd(X0,X0),sK0(rd(X0,X0))) != sK0(rd(X0,X0)),
inference(superposition,[status(thm)],[c_14865,c_82]) ).
cnf(c_15351,plain,
sK0(rd(X0,X0)) != sK0(rd(X0,X0)),
inference(demodulation,[status(thm)],[c_15146,c_14878]) ).
cnf(c_15352,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_15351]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP659+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.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 : Thu May 2 23:40:57 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.30/1.68 % SZS status Started for theBenchmark.p
% 8.30/1.68 % SZS status Theorem for theBenchmark.p
% 8.30/1.68
% 8.30/1.68 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.30/1.68
% 8.30/1.68 ------ iProver source info
% 8.30/1.68
% 8.30/1.68 git: date: 2024-05-02 19:28:25 +0000
% 8.30/1.68 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.30/1.68 git: non_committed_changes: false
% 8.30/1.68
% 8.30/1.68 ------ Parsing...
% 8.30/1.68 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.30/1.68
% 8.30/1.68 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 8.30/1.68
% 8.30/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.30/1.68
% 8.30/1.68 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 8.30/1.68 ------ Proving...
% 8.30/1.68 ------ Problem Properties
% 8.30/1.68
% 8.30/1.68
% 8.30/1.68 clauses 6
% 8.30/1.68 conjectures 1
% 8.30/1.68 EPR 0
% 8.30/1.68 Horn 6
% 8.30/1.68 unary 5
% 8.30/1.68 binary 1
% 8.30/1.68 lits 7
% 8.30/1.68 lits eq 7
% 8.30/1.68 fd_pure 0
% 8.30/1.68 fd_pseudo 0
% 8.30/1.68 fd_cond 0
% 8.30/1.68 fd_pseudo_cond 0
% 8.30/1.68 AC symbols 0
% 8.30/1.68
% 8.30/1.68 ------ Schedule dynamic 5 is on
% 8.30/1.68
% 8.30/1.68 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.30/1.68
% 8.30/1.68
% 8.30/1.68 ------
% 8.30/1.68 Current options:
% 8.30/1.68 ------
% 8.30/1.68
% 8.30/1.68
% 8.30/1.68
% 8.30/1.68
% 8.30/1.68 ------ Proving...
% 8.30/1.68
% 8.30/1.68
% 8.30/1.68 % SZS status Theorem for theBenchmark.p
% 8.30/1.68
% 8.30/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.30/1.68
% 8.30/1.69
%------------------------------------------------------------------------------