TSTP Solution File: GRP711+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP711+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:32 EDT 2024
% Result : Theorem 8.01s 1.64s
% Output : CNFRefutation 8.01s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f5,axiom,
! [X0] : unit = mult(i(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f6,conjecture,
! [X3,X4,X5] :
( ( mult(X4,X3) = mult(X5,X3)
=> X4 = X5 )
& ( mult(X3,X4) = mult(X3,X5)
=> X4 = X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f7,negated_conjecture,
~ ! [X3,X4,X5] :
( ( mult(X4,X3) = mult(X5,X3)
=> X4 = X5 )
& ( mult(X3,X4) = mult(X3,X5)
=> X4 = X5 ) ),
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(X1,X0) = mult(X2,X0)
=> X1 = X2 )
& ( mult(X0,X2) = mult(X0,X1)
=> X1 = X2 ) ),
inference(rectify,[],[f7]) ).
fof(f10,plain,
? [X0,X1,X2] :
( ( X1 != X2
& mult(X1,X0) = mult(X2,X0) )
| ( X1 != X2
& mult(X0,X2) = mult(X0,X1) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f11,plain,
( ? [X0,X1,X2] :
( ( X1 != X2
& mult(X1,X0) = mult(X2,X0) )
| ( X1 != X2
& mult(X0,X2) = mult(X0,X1) ) )
=> ( ( sK1 != sK2
& mult(sK1,sK0) = mult(sK2,sK0) )
| ( sK1 != sK2
& mult(sK0,sK2) = mult(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ( sK1 != sK2
& mult(sK1,sK0) = mult(sK2,sK0) )
| ( sK1 != sK2
& mult(sK0,sK2) = mult(sK0,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11]) ).
fof(f13,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f15,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(i(X0),X0),
inference(cnf_transformation,[],[f5]) ).
fof(f18,plain,
( mult(sK1,sK0) = mult(sK2,sK0)
| mult(sK0,sK2) = mult(sK0,sK1) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_49,plain,
mult(X0,unit) = X0,
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,plain,
mult(unit,X0) = X0,
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,plain,
mult(mult(mult(X0,X1),X1),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(cnf_transformation,[],[f15]) ).
cnf(c_53,plain,
mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f17]) ).
cnf(c_54,negated_conjecture,
sK1 != sK2,
inference(cnf_transformation,[],[f22]) ).
cnf(c_57,negated_conjecture,
( mult(sK1,sK0) = mult(sK2,sK0)
| mult(sK0,sK1) = mult(sK0,sK2) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_109,plain,
mult(sK1,sK0) = sP0_iProver_def,
definition ).
cnf(c_110,plain,
mult(sK2,sK0) = sP1_iProver_def,
definition ).
cnf(c_111,plain,
mult(sK0,sK1) = sP2_iProver_def,
definition ).
cnf(c_112,plain,
mult(sK0,sK2) = sP3_iProver_def,
definition ).
cnf(c_113,negated_conjecture,
( sP0_iProver_def = sP1_iProver_def
| sP2_iProver_def = sP3_iProver_def ),
inference(demodulation,[status(thm)],[c_57,c_112,c_111,c_110,c_109]) ).
cnf(c_114,negated_conjecture,
sK1 != sK2,
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_115,plain,
X0 = X0,
theory(equality) ).
cnf(c_116,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_168,plain,
mult(sK1,mult(sK0,mult(sK0,X0))) = mult(mult(sP0_iProver_def,sK0),X0),
inference(superposition,[status(thm)],[c_109,c_51]) ).
cnf(c_169,plain,
mult(sK2,mult(sK0,mult(sK0,X0))) = mult(mult(sP1_iProver_def,sK0),X0),
inference(superposition,[status(thm)],[c_110,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_192,plain,
mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_193,plain,
mult(i(X0),mult(X0,mult(X0,X1))) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_192,c_50]) ).
cnf(c_200,plain,
mult(i(X0),mult(X0,X0)) = X0,
inference(superposition,[status(thm)],[c_49,c_193]) ).
cnf(c_206,plain,
mult(i(sK0),mult(sK0,sP2_iProver_def)) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_111,c_193]) ).
cnf(c_209,plain,
mult(i(i(X0)),mult(i(X0),mult(X0,X1))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_193,c_193]) ).
cnf(c_223,plain,
( sK1 != X0
| sK2 != X0
| sK1 = sK2 ),
inference(instantiation,[status(thm)],[c_116]) ).
cnf(c_226,plain,
sK1 = sK1,
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_227,plain,
( X0 != X1
| sK1 != X1
| sK1 = X0 ),
inference(instantiation,[status(thm)],[c_116]) ).
cnf(c_234,plain,
( X0 != sK1
| sK1 != sK1
| sK1 = X0 ),
inference(instantiation,[status(thm)],[c_227]) ).
cnf(c_240,plain,
mult(i(i(X0)),mult(i(X0),X0)) = X0,
inference(superposition,[status(thm)],[c_200,c_193]) ).
cnf(c_243,plain,
mult(i(i(X0)),unit) = X0,
inference(light_normalisation,[status(thm)],[c_240,c_53]) ).
cnf(c_250,plain,
( mult(sK1,unit) != sK1
| sK1 != sK1
| sK1 = mult(sK1,unit) ),
inference(instantiation,[status(thm)],[c_234]) ).
cnf(c_251,plain,
mult(sK1,unit) = sK1,
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_258,plain,
i(i(X0)) = X0,
inference(demodulation,[status(thm)],[c_243,c_49]) ).
cnf(c_269,plain,
mult(i(i(sK0)),mult(i(sK0),sP2_iProver_def)) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_206,c_193]) ).
cnf(c_273,plain,
( sK1 != mult(sK1,unit)
| sK2 != mult(sK1,unit)
| sK1 = sK2 ),
inference(instantiation,[status(thm)],[c_223]) ).
cnf(c_375,plain,
( mult(sK1,unit) != X0
| sK2 != X0
| sK2 = mult(sK1,unit) ),
inference(instantiation,[status(thm)],[c_116]) ).
cnf(c_441,plain,
mult(sK0,mult(i(sK0),sP2_iProver_def)) = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_269,c_258]) ).
cnf(c_474,plain,
sK2 = sK2,
inference(instantiation,[status(thm)],[c_115]) ).
cnf(c_812,plain,
( mult(sK1,unit) != sK2
| sK2 != sK2
| sK2 = mult(sK1,unit) ),
inference(instantiation,[status(thm)],[c_375]) ).
cnf(c_1300,plain,
mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(demodulation,[status(thm)],[c_170,c_49]) ).
cnf(c_1301,plain,
mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(demodulation,[status(thm)],[c_51,c_1300]) ).
cnf(c_4655,plain,
mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(unit,X1),
inference(superposition,[status(thm)],[c_53,c_1301]) ).
cnf(c_4874,plain,
mult(X0,mult(i(X0),mult(X0,X1))) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_209,c_258]) ).
cnf(c_5503,plain,
mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
inference(demodulation,[status(thm)],[c_4655,c_50]) ).
cnf(c_5531,plain,
mult(i(mult(sK0,sK0)),mult(sK0,sP3_iProver_def)) = sK2,
inference(superposition,[status(thm)],[c_112,c_5503]) ).
cnf(c_5551,plain,
mult(i(mult(sK0,sK0)),mult(sK0,sP2_iProver_def)) = mult(i(sK0),sP2_iProver_def),
inference(superposition,[status(thm)],[c_441,c_5503]) ).
cnf(c_5612,plain,
mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(i(X0),mult(X0,X1)),
inference(superposition,[status(thm)],[c_4874,c_5503]) ).
cnf(c_5632,plain,
mult(i(X0),mult(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_5612,c_5503]) ).
cnf(c_5983,plain,
( mult(i(mult(sK0,sK0)),mult(sK0,sP2_iProver_def)) = sK2
| sP0_iProver_def = sP1_iProver_def ),
inference(superposition,[status(thm)],[c_113,c_5531]) ).
cnf(c_5986,plain,
( mult(i(sK0),sP2_iProver_def) = sK2
| sP0_iProver_def = sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_5983,c_5551]) ).
cnf(c_6003,plain,
mult(X0,mult(i(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_258,c_5632]) ).
cnf(c_6010,plain,
mult(i(sK0),sP2_iProver_def) = sK1,
inference(superposition,[status(thm)],[c_111,c_5632]) ).
cnf(c_6396,plain,
( sK1 = sK2
| sP0_iProver_def = sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_5986,c_6010]) ).
cnf(c_6397,plain,
sP0_iProver_def = sP1_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_6396,c_114]) ).
cnf(c_6414,plain,
mult(sK2,mult(sK0,mult(sK0,X0))) = mult(mult(sP0_iProver_def,sK0),X0),
inference(demodulation,[status(thm)],[c_169,c_6397]) ).
cnf(c_7076,plain,
mult(mult(sP0_iProver_def,sK0),mult(i(sK0),X0)) = mult(sK2,mult(sK0,X0)),
inference(superposition,[status(thm)],[c_6003,c_6414]) ).
cnf(c_7077,plain,
mult(mult(sP0_iProver_def,sK0),mult(i(sK0),X0)) = mult(sK1,mult(sK0,X0)),
inference(superposition,[status(thm)],[c_6003,c_168]) ).
cnf(c_7185,plain,
mult(sK1,mult(sK0,X0)) = mult(sK2,mult(sK0,X0)),
inference(demodulation,[status(thm)],[c_7076,c_7077]) ).
cnf(c_7199,plain,
mult(sK1,X0) = mult(sK2,X0),
inference(superposition,[status(thm)],[c_6003,c_7185]) ).
cnf(c_7299,plain,
mult(sK1,unit) = sK2,
inference(superposition,[status(thm)],[c_7199,c_49]) ).
cnf(c_7317,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7299,c_812,c_474,c_273,c_251,c_250,c_226,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP711+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 00:03:06 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 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
% 8.01/1.64 % SZS status Started for theBenchmark.p
% 8.01/1.64 % SZS status Theorem for theBenchmark.p
% 8.01/1.64
% 8.01/1.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.01/1.64
% 8.01/1.64 ------ iProver source info
% 8.01/1.64
% 8.01/1.64 git: date: 2024-05-02 19:28:25 +0000
% 8.01/1.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.01/1.64 git: non_committed_changes: false
% 8.01/1.64
% 8.01/1.64 ------ Parsing...
% 8.01/1.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.01/1.64
% 8.01/1.64 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 8.01/1.64
% 8.01/1.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.01/1.64
% 8.01/1.64 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 8.01/1.64 ------ Proving...
% 8.01/1.64 ------ Problem Properties
% 8.01/1.64
% 8.01/1.64
% 8.01/1.64 clauses 11
% 8.01/1.64 conjectures 2
% 8.01/1.64 EPR 2
% 8.01/1.64 Horn 10
% 8.01/1.64 unary 10
% 8.01/1.64 binary 1
% 8.01/1.64 lits 12
% 8.01/1.64 lits eq 12
% 8.01/1.64 fd_pure 0
% 8.01/1.64 fd_pseudo 0
% 8.01/1.64 fd_cond 0
% 8.01/1.64 fd_pseudo_cond 0
% 8.01/1.64 AC symbols 0
% 8.01/1.64
% 8.01/1.64 ------ Schedule dynamic 5 is on
% 8.01/1.64
% 8.01/1.64 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.01/1.64
% 8.01/1.64
% 8.01/1.64 ------
% 8.01/1.64 Current options:
% 8.01/1.64 ------
% 8.01/1.64
% 8.01/1.64
% 8.01/1.64
% 8.01/1.64
% 8.01/1.64 ------ Proving...
% 8.01/1.64
% 8.01/1.64
% 8.01/1.64 % SZS status Theorem for theBenchmark.p
% 8.01/1.64
% 8.01/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.01/1.64
% 8.01/1.65
%------------------------------------------------------------------------------