TSTP Solution File: GRP370-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP370-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 00:59:34 EDT 2023
% Result : Unsatisfiable 3.77s 1.14s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 11
% Syntax : Number of clauses : 65 ( 21 unt; 27 nHn; 53 RR)
% Number of literals : 145 ( 109 equ; 66 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_53,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(c_54,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_6) ).
cnf(c_55,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_7) ).
cnf(c_58,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(c_59,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(c_63,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c8
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_15) ).
cnf(c_64,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(c_77,negated_conjecture,
( multiply(X0,X1) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != X5
| multiply(sk_c9,X5) != sk_c7
| multiply(sk_c7,sk_c8) != sk_c9
| inverse(X0) != X1
| inverse(X2) != sk_c9
| inverse(X3) != sk_c7
| inverse(X4) != sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_29) ).
cnf(c_78,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_79,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_80,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_81,negated_conjecture,
( multiply(sk_c9,multiply(X0,sk_c9)) != sk_c7
| multiply(X1,inverse(X1)) != sk_c8
| multiply(inverse(X1),sk_c7) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(sk_c7,sk_c8) != sk_c9
| inverse(X0) != sk_c9
| inverse(X2) != sk_c9
| inverse(X3) != sk_c7 ),
inference(unflattening,[status(thm)],[c_77]) ).
cnf(c_354,negated_conjecture,
( multiply(X0,sk_c9) != sk_c8
| inverse(X0) != sk_c9
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_81]) ).
cnf(c_355,negated_conjecture,
( multiply(X0,inverse(X0)) != sk_c8
| multiply(inverse(X0),sk_c7) != sk_c8
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_81]) ).
cnf(c_356,negated_conjecture,
( multiply(X0,sk_c7) != sk_c8
| inverse(X0) != sk_c7
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_81]) ).
cnf(c_357,negated_conjecture,
( multiply(sk_c9,multiply(X0,sk_c9)) != sk_c7
| inverse(X0) != sk_c9
| ~ sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP3_iProver_split])],[c_81]) ).
cnf(c_358,negated_conjecture,
( multiply(sk_c7,sk_c8) != sk_c9
| sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split
| sP3_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_81]) ).
cnf(c_752,plain,
( inverse(inverse(sk_c9)) != sk_c9
| sk_c8 != identity
| ~ sP0_iProver_split ),
inference(superposition,[status(thm)],[c_79,c_354]) ).
cnf(c_802,plain,
( inverse(inverse(sk_c7)) != sk_c7
| sk_c8 != identity
| ~ sP2_iProver_split ),
inference(superposition,[status(thm)],[c_79,c_356]) ).
cnf(c_901,plain,
( multiply(sk_c7,inverse(sk_c7)) != sk_c8
| sk_c8 != identity
| ~ sP1_iProver_split ),
inference(superposition,[status(thm)],[c_79,c_355]) ).
cnf(c_964,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_79,c_80]) ).
cnf(c_1117,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_964,c_78]) ).
cnf(c_1147,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_79,c_1117]) ).
cnf(c_1152,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_1117,c_1117]) ).
cnf(c_1337,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_1147,c_1152]) ).
cnf(c_1383,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_1152,c_79]) ).
cnf(c_1388,plain,
multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_1152,c_1117]) ).
cnf(c_1389,plain,
multiply(X0,identity) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_1152,c_1337]) ).
cnf(c_1390,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1389,c_1337]) ).
cnf(c_1846,plain,
( multiply(sk_c3,sk_c9) = identity
| inverse(sk_c1) = sk_c2 ),
inference(superposition,[status(thm)],[c_64,c_1383]) ).
cnf(c_1932,plain,
( inverse(inverse(sk_c9)) != sk_c9
| sk_c7 != sk_c9
| ~ sP3_iProver_split ),
inference(superposition,[status(thm)],[c_1388,c_357]) ).
cnf(c_1949,plain,
( sk_c7 != sk_c9
| ~ sP3_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_1932,c_1390]) ).
cnf(c_2068,plain,
( inverse(sk_c1) = sk_c2
| sk_c8 = identity ),
inference(superposition,[status(thm)],[c_1846,c_63]) ).
cnf(c_2092,plain,
( multiply(sk_c1,sk_c2) = identity
| sk_c8 = identity ),
inference(superposition,[status(thm)],[c_2068,c_1383]) ).
cnf(c_3275,plain,
( inverse(sk_c4) = sk_c7
| sk_c8 = identity ),
inference(superposition,[status(thm)],[c_2092,c_59]) ).
cnf(c_3338,plain,
( multiply(sk_c4,sk_c7) = identity
| sk_c8 = identity ),
inference(superposition,[status(thm)],[c_3275,c_1383]) ).
cnf(c_4435,plain,
( multiply(sk_c1,sk_c2) = sk_c8
| sk_c8 = identity ),
inference(superposition,[status(thm)],[c_3338,c_58]) ).
cnf(c_4511,plain,
sk_c8 = identity,
inference(superposition,[status(thm)],[c_4435,c_2092]) ).
cnf(c_4555,plain,
( multiply(sk_c7,identity) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c6 ),
inference(demodulation,[status(thm)],[c_54,c_4511]) ).
cnf(c_4556,plain,
( multiply(sk_c7,identity) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c7 ),
inference(demodulation,[status(thm)],[c_53,c_4511]) ).
cnf(c_4558,plain,
( multiply(sk_c7,identity) != sk_c9
| sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split
| sP3_iProver_split ),
inference(demodulation,[status(thm)],[c_358,c_4511]) ).
cnf(c_4568,plain,
( multiply(sk_c7,identity) = sk_c9
| inverse(sk_c5) = sk_c9 ),
inference(demodulation,[status(thm)],[c_55,c_4511]) ).
cnf(c_4692,plain,
( sk_c7 != sk_c9
| sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split
| sP3_iProver_split ),
inference(demodulation,[status(thm)],[c_4558,c_1337]) ).
cnf(c_4698,plain,
( sk_c7 != sk_c9
| sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(forward_subsumption_resolution,[status(thm)],[c_4692,c_1949]) ).
cnf(c_5311,plain,
( inverse(sk_c5) = sk_c9
| sk_c7 = sk_c9 ),
inference(demodulation,[status(thm)],[c_4568,c_1337]) ).
cnf(c_5318,plain,
( multiply(sk_c5,sk_c9) = identity
| sk_c7 = sk_c9 ),
inference(superposition,[status(thm)],[c_5311,c_1383]) ).
cnf(c_5646,plain,
( multiply(sk_c5,sk_c9) = sk_c6
| sk_c7 = sk_c9 ),
inference(demodulation,[status(thm)],[c_4555,c_1337]) ).
cnf(c_5738,plain,
( multiply(sk_c9,sk_c6) = sk_c7
| sk_c7 = sk_c9 ),
inference(demodulation,[status(thm)],[c_4556,c_1337]) ).
cnf(c_6294,plain,
( sk_c7 = sk_c9
| sk_c6 = identity ),
inference(superposition,[status(thm)],[c_5318,c_5646]) ).
cnf(c_6456,plain,
( multiply(sk_c9,identity) = sk_c7
| sk_c7 = sk_c9 ),
inference(superposition,[status(thm)],[c_6294,c_5738]) ).
cnf(c_6614,plain,
( inverse(inverse(sk_c9)) != sk_c9
| ~ sP0_iProver_split ),
inference(global_subsumption_just,[status(thm)],[c_752,c_752,c_4511]) ).
cnf(c_6616,plain,
( sk_c9 != sk_c9
| ~ sP0_iProver_split ),
inference(demodulation,[status(thm)],[c_6614,c_1390]) ).
cnf(c_6617,plain,
~ sP0_iProver_split,
inference(equality_resolution_simp,[status(thm)],[c_6616]) ).
cnf(c_6618,plain,
( sk_c7 != sk_c9
| sP1_iProver_split
| sP2_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_4698,c_6617]) ).
cnf(c_6933,plain,
( inverse(inverse(sk_c7)) != sk_c7
| ~ sP2_iProver_split ),
inference(global_subsumption_just,[status(thm)],[c_802,c_802,c_4511]) ).
cnf(c_6935,plain,
( sk_c7 != sk_c7
| ~ sP2_iProver_split ),
inference(demodulation,[status(thm)],[c_6933,c_1390]) ).
cnf(c_6936,plain,
~ sP2_iProver_split,
inference(equality_resolution_simp,[status(thm)],[c_6935]) ).
cnf(c_6940,plain,
( sk_c7 != sk_c9
| sP1_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_6618,c_6936]) ).
cnf(c_7283,plain,
sk_c7 = sk_c9,
inference(demodulation,[status(thm)],[c_6456,c_1337]) ).
cnf(c_7287,plain,
( sk_c9 != sk_c9
| sP1_iProver_split ),
inference(demodulation,[status(thm)],[c_6940,c_7283]) ).
cnf(c_7341,plain,
sP1_iProver_split,
inference(equality_resolution_simp,[status(thm)],[c_7287]) ).
cnf(c_7411,plain,
multiply(sk_c7,inverse(sk_c7)) != sk_c8,
inference(global_subsumption_just,[status(thm)],[c_901,c_901,c_4511,c_7341]) ).
cnf(c_7413,plain,
multiply(sk_c9,inverse(sk_c9)) != identity,
inference(light_normalisation,[status(thm)],[c_7411,c_4511,c_7283]) ).
cnf(c_7414,plain,
identity != identity,
inference(demodulation,[status(thm)],[c_7413,c_1383]) ).
cnf(c_7415,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_7414]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP370-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 00:22:25 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.77/1.14 % SZS status Started for theBenchmark.p
% 3.77/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.14
% 3.77/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.77/1.14
% 3.77/1.14 ------ iProver source info
% 3.77/1.14
% 3.77/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.77/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.77/1.14 git: non_committed_changes: false
% 3.77/1.14 git: last_make_outside_of_git: false
% 3.77/1.14
% 3.77/1.14 ------ Parsing...successful
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.77/1.14
% 3.77/1.14 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.77/1.14
% 3.77/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.77/1.14 ------ Proving...
% 3.77/1.14 ------ Problem Properties
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 clauses 36
% 3.77/1.14 conjectures 33
% 3.77/1.14 EPR 0
% 3.77/1.14 Horn 7
% 3.77/1.14 unary 3
% 3.77/1.14 binary 28
% 3.77/1.14 lits 76
% 3.77/1.14 lits eq 68
% 3.77/1.14 fd_pure 0
% 3.77/1.14 fd_pseudo 0
% 3.77/1.14 fd_cond 0
% 3.77/1.14 fd_pseudo_cond 0
% 3.77/1.14 AC symbols 0
% 3.77/1.14
% 3.77/1.14 ------ Schedule dynamic 5 is on
% 3.77/1.14
% 3.77/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 ------
% 3.77/1.14 Current options:
% 3.77/1.14 ------
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 ------ Proving...
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.14
% 3.77/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.14
% 3.77/1.15
%------------------------------------------------------------------------------