TSTP Solution File: GRP700-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP700-10 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:28 EDT 2024
% Result : Unsatisfiable 3.81s 1.12s
% Output : CNFRefutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 3 RR)
% Number of literals : 20 ( 19 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(c_51,plain,
mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(c_53,plain,
mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(c_54,plain,
mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(c_56,plain,
mult(mult(X0,mult(X1,mult(X1,X2))),X1) = mult(mult(X0,X1),mult(X1,mult(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(c_57,negated_conjecture,
tuple(mult(X0,x0),mult(x0,X0)) != tuple(unit,unit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_154,plain,
ld(X0,X0) = unit,
inference(superposition,[status(thm)],[c_53,c_50]) ).
cnf(c_161,plain,
ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_163,plain,
tuple(X0,mult(x0,rd(X0,x0))) != tuple(unit,unit),
inference(superposition,[status(thm)],[c_51,c_57]) ).
cnf(c_210,plain,
mult(mult(unit,X0),mult(X0,mult(X1,X0))) = mult(mult(X0,mult(X0,X1)),X0),
inference(superposition,[status(thm)],[c_54,c_56]) ).
cnf(c_232,plain,
mult(mult(X0,mult(X0,X1)),X0) = mult(X0,mult(X0,mult(X1,X0))),
inference(light_normalisation,[status(thm)],[c_210,c_54]) ).
cnf(c_380,plain,
rd(mult(X0,mult(X0,mult(X1,X0))),X0) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_232,c_52]) ).
cnf(c_613,plain,
mult(X0,mult(X0,rd(X1,X0))) = rd(mult(X0,mult(X0,X1)),X0),
inference(superposition,[status(thm)],[c_51,c_380]) ).
cnf(c_1571,plain,
mult(X0,mult(X0,rd(unit,X0))) = rd(mult(X0,X0),X0),
inference(superposition,[status(thm)],[c_53,c_613]) ).
cnf(c_1627,plain,
rd(rd(mult(X0,X0),X0),mult(X0,rd(unit,X0))) = X0,
inference(superposition,[status(thm)],[c_1571,c_52]) ).
cnf(c_1682,plain,
rd(X0,mult(X0,rd(unit,X0))) = X0,
inference(superposition,[status(thm)],[c_52,c_1627]) ).
cnf(c_1734,plain,
mult(X0,rd(unit,X0)) = ld(X0,X0),
inference(superposition,[status(thm)],[c_1682,c_161]) ).
cnf(c_1740,plain,
mult(X0,rd(unit,X0)) = unit,
inference(light_normalisation,[status(thm)],[c_1734,c_154]) ).
cnf(c_1781,plain,
$false,
inference(superposition,[status(thm)],[c_1740,c_163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP700-10 : TPTP v8.1.2. Released v8.1.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:59:58 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.44 Running UEQ theorem proving
% 0.19/0.44 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.81/1.12 % SZS status Started for theBenchmark.p
% 3.81/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.12
% 3.81/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.81/1.12
% 3.81/1.12 ------ iProver source info
% 3.81/1.12
% 3.81/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.81/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.81/1.12 git: non_committed_changes: false
% 3.81/1.12
% 3.81/1.12 ------ Parsing...successful
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.81/1.12
% 3.81/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.81/1.12
% 3.81/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.81/1.12 ------ Proving...
% 3.81/1.12 ------ Problem Properties
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12 clauses 9
% 3.81/1.12 conjectures 1
% 3.81/1.12 EPR 0
% 3.81/1.12 Horn 9
% 3.81/1.12 unary 9
% 3.81/1.12 binary 0
% 3.81/1.12 lits 9
% 3.81/1.12 lits eq 9
% 3.81/1.12 fd_pure 0
% 3.81/1.12 fd_pseudo 0
% 3.81/1.12 fd_cond 0
% 3.81/1.12 fd_pseudo_cond 0
% 3.81/1.12 AC symbols 0
% 3.81/1.12
% 3.81/1.12 ------ Input Options Time Limit: Unbounded
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12 ------
% 3.81/1.12 Current options:
% 3.81/1.12 ------
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12 ------ Proving...
% 3.81/1.12
% 3.81/1.12
% 3.81/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.12
% 3.81/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.81/1.12
% 3.81/1.12
%------------------------------------------------------------------------------