TSTP Solution File: GRP086-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP086-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:57:27 EDT 2023
% Result : Unsatisfiable 4.02s 1.17s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of clauses : 25 ( 20 unt; 0 nHn; 7 RR)
% Number of literals : 36 ( 35 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X0,X2)))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,negated_conjecture,
( multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_111,plain,
multiply(X0,multiply(X1,inverse(multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X3,X2))))))) = X3,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_115,plain,
multiply(X0,multiply(X1,inverse(X1))) = X0,
inference(superposition,[status(thm)],[c_49,c_111]) ).
cnf(c_142,plain,
multiply(X0,multiply(X1,inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_115,c_111]) ).
cnf(c_161,plain,
multiply(X0,multiply(multiply(X1,multiply(X2,inverse(X0))),inverse(X2))) = X1,
inference(superposition,[status(thm)],[c_142,c_49]) ).
cnf(c_163,plain,
multiply(multiply(X0,X1),multiply(X2,inverse(multiply(X2,X1)))) = X0,
inference(superposition,[status(thm)],[c_142,c_111]) ).
cnf(c_188,plain,
multiply(multiply(X0,X1),multiply(X2,inverse(X0))) = multiply(X2,X1),
inference(superposition,[status(thm)],[c_163,c_111]) ).
cnf(c_307,plain,
multiply(X0,multiply(multiply(X1,X2),inverse(X1))) = multiply(X0,X2),
inference(superposition,[status(thm)],[c_188,c_161]) ).
cnf(c_357,plain,
multiply(multiply(X0,X1),X2) = multiply(multiply(X0,X2),X1),
inference(superposition,[status(thm)],[c_307,c_188]) ).
cnf(c_427,plain,
multiply(X0,multiply(multiply(X1,inverse(X0)),X2)) = multiply(X1,X2),
inference(superposition,[status(thm)],[c_357,c_142]) ).
cnf(c_486,plain,
multiply(X0,inverse(multiply(X0,inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_427,c_115]) ).
cnf(c_490,plain,
multiply(X0,inverse(X0)) = multiply(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_427,c_307]) ).
cnf(c_509,plain,
multiply(multiply(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_486,c_142]) ).
cnf(c_531,plain,
multiply(multiply(X0,X1),inverse(X1)) = X0,
inference(demodulation,[status(thm)],[c_509,c_357]) ).
cnf(c_545,plain,
multiply(multiply(X0,X1),X2) = multiply(X1,multiply(X0,X2)),
inference(superposition,[status(thm)],[c_531,c_427]) ).
cnf(c_546,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_531,c_142]) ).
cnf(c_553,plain,
( multiply(b2,multiply(inverse(b2),a2)) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(a4,b4) != multiply(b4,a4) ),
inference(demodulation,[status(thm)],[c_50,c_545]) ).
cnf(c_554,plain,
( multiply(b2,multiply(inverse(b2),a2)) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_553,c_546]) ).
cnf(c_602,plain,
( multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(a3,c3))
| multiply(a1,inverse(a1)) != multiply(b1,inverse(b1))
| a2 != a2 ),
inference(demodulation,[status(thm)],[c_554,c_142,c_545,c_546]) ).
cnf(c_603,plain,
( multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(a3,c3))
| multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)) ),
inference(equality_resolution_simp,[status(thm)],[c_602]) ).
cnf(c_808,plain,
multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(a3,c3)),
inference(backward_subsumption_resolution,[status(thm)],[c_603,c_490]) ).
cnf(c_1537,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(superposition,[status(thm)],[c_546,c_545]) ).
cnf(c_1737,plain,
multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X0,X2)),
inference(superposition,[status(thm)],[c_1537,c_545]) ).
cnf(c_1749,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_808,c_1737]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP086-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 00:53:19 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.02/1.17 % SZS status Started for theBenchmark.p
% 4.02/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.02/1.17
% 4.02/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.02/1.17
% 4.02/1.17 ------ iProver source info
% 4.02/1.17
% 4.02/1.17 git: date: 2023-05-31 18:12:56 +0000
% 4.02/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.02/1.17 git: non_committed_changes: false
% 4.02/1.17 git: last_make_outside_of_git: false
% 4.02/1.17
% 4.02/1.17 ------ Parsing...successful
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.02/1.17
% 4.02/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.02/1.17
% 4.02/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.02/1.17 ------ Proving...
% 4.02/1.17 ------ Problem Properties
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 clauses 2
% 4.02/1.17 conjectures 1
% 4.02/1.17 EPR 0
% 4.02/1.17 Horn 2
% 4.02/1.17 unary 1
% 4.02/1.17 binary 0
% 4.02/1.17 lits 5
% 4.02/1.17 lits eq 5
% 4.02/1.17 fd_pure 0
% 4.02/1.17 fd_pseudo 0
% 4.02/1.17 fd_cond 0
% 4.02/1.17 fd_pseudo_cond 0
% 4.02/1.17 AC symbols 0
% 4.02/1.17
% 4.02/1.17 ------ Schedule dynamic 5 is on
% 4.02/1.17
% 4.02/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 ------
% 4.02/1.17 Current options:
% 4.02/1.17 ------
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 ------ Proving...
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 4.02/1.17
% 4.02/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.02/1.17
% 4.02/1.17
%------------------------------------------------------------------------------