TSTP Solution File: GRP195-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP195-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:21:42 EDT 2024
% Result : Unsatisfiable 3.58s 1.09s
% Output : CNFRefutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 11 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
multiply(X0,multiply(X0,X1)) = multiply(X1,multiply(X0,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
cnf(c_50,negated_conjecture,
multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))) != multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_51,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP008-0.ax',associativity_of_multiply) ).
cnf(c_152,plain,
multiply(X0,multiply(multiply(X1,X2),multiply(X1,X2))) = multiply(X1,multiply(X2,multiply(multiply(X1,X2),X0))),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_155,plain,
multiply(multiply(X0,multiply(X0,X1)),X2) = multiply(X1,multiply(multiply(X0,X0),X2)),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_156,plain,
multiply(X0,multiply(X0,multiply(X1,X2))) = multiply(X1,multiply(X2,multiply(X0,X0))),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_159,plain,
multiply(X0,multiply(X0,multiply(X1,X2))) = multiply(X1,multiply(X0,multiply(X0,X2))),
inference(demodulation,[status(thm)],[c_155,c_51]) ).
cnf(c_168,plain,
multiply(X0,multiply(X1,multiply(X0,multiply(X1,X2)))) = multiply(X2,multiply(X0,multiply(X1,multiply(X0,X1)))),
inference(demodulation,[status(thm)],[c_152,c_51]) ).
cnf(c_174,plain,
multiply(a,multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(b,b))))))) != multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))),
inference(demodulation,[status(thm)],[c_50,c_159]) ).
cnf(c_565,plain,
multiply(a,multiply(a,multiply(b,multiply(a,multiply(b,multiply(b,multiply(a,b))))))) != multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))),
inference(superposition,[status(thm)],[c_156,c_174]) ).
cnf(c_728,plain,
multiply(b,multiply(b,multiply(b,multiply(b,multiply(a,multiply(a,multiply(a,a))))))) != multiply(b,multiply(b,multiply(b,multiply(b,multiply(a,multiply(a,multiply(a,a))))))),
inference(demodulation,[status(thm)],[c_565,c_156,c_159,c_168]) ).
cnf(c_729,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_728]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : GRP195-1 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 23:59:28 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running UEQ theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.58/1.09 % SZS status Started for theBenchmark.p
% 3.58/1.09 % SZS status Unsatisfiable for theBenchmark.p
% 3.58/1.09
% 3.58/1.09 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.58/1.09
% 3.58/1.09 ------ iProver source info
% 3.58/1.09
% 3.58/1.09 git: date: 2024-05-02 19:28:25 +0000
% 3.58/1.09 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.58/1.09 git: non_committed_changes: false
% 3.58/1.09
% 3.58/1.09 ------ Parsing...successful
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.58/1.09
% 3.58/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.58/1.09
% 3.58/1.09 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.58/1.09 ------ Proving...
% 3.58/1.09 ------ Problem Properties
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09 clauses 3
% 3.58/1.09 conjectures 1
% 3.58/1.09 EPR 0
% 3.58/1.09 Horn 3
% 3.58/1.09 unary 3
% 3.58/1.09 binary 0
% 3.58/1.09 lits 3
% 3.58/1.09 lits eq 3
% 3.58/1.09 fd_pure 0
% 3.58/1.09 fd_pseudo 0
% 3.58/1.09 fd_cond 0
% 3.58/1.09 fd_pseudo_cond 0
% 3.58/1.09 AC symbols 0
% 3.58/1.09
% 3.58/1.09 ------ Input Options Time Limit: Unbounded
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09 ------
% 3.58/1.09 Current options:
% 3.58/1.09 ------
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09 ------ Proving...
% 3.58/1.09
% 3.58/1.09
% 3.58/1.09 % SZS status Unsatisfiable for theBenchmark.p
% 3.58/1.09
% 3.58/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.58/1.09
% 3.58/1.09
%------------------------------------------------------------------------------