TSTP Solution File: GRP700-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP700-10 : TPTP v8.2.0. Released v8.1.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 : Mon Jun 24 07:01:50 EDT 2024
% Result : Unsatisfiable 3.21s 1.13s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 3 RR)
% Number of literals : 21 ( 20 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(c_51,plain,
mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(c_53,plain,
mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(c_54,plain,
mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(c_55,plain,
mult(mult(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(mult(mult(X1,X0),X0),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(c_57,negated_conjecture,
tuple(mult(X0,x0),mult(x0,X0)) != tuple(unit,unit),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_153,plain,
tuple(mult(ld(x0,X0),x0),X0) != tuple(unit,unit),
inference(superposition,[status(thm)],[c_49,c_57]) ).
cnf(c_163,plain,
ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_171,plain,
rd(X0,X0) = unit,
inference(superposition,[status(thm)],[c_54,c_52]) ).
cnf(c_175,plain,
mult(X0,mult(mult(mult(ld(X0,X1),X0),X0),X2)) = mult(mult(X1,X0),mult(X0,X2)),
inference(superposition,[status(thm)],[c_49,c_55]) ).
cnf(c_476,plain,
mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),mult(X0,unit)),
inference(superposition,[status(thm)],[c_53,c_175]) ).
cnf(c_507,plain,
mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),X0),
inference(light_normalisation,[status(thm)],[c_476,c_53]) ).
cnf(c_1119,plain,
rd(mult(mult(X0,X1),X1),mult(mult(ld(X1,X0),X1),X1)) = X1,
inference(superposition,[status(thm)],[c_507,c_52]) ).
cnf(c_3998,plain,
rd(mult(X0,X0),mult(mult(ld(X0,unit),X0),X0)) = X0,
inference(superposition,[status(thm)],[c_54,c_1119]) ).
cnf(c_4082,plain,
mult(mult(ld(X0,unit),X0),X0) = ld(X0,mult(X0,X0)),
inference(superposition,[status(thm)],[c_3998,c_163]) ).
cnf(c_4764,plain,
mult(mult(ld(X0,unit),X0),X0) = X0,
inference(demodulation,[status(thm)],[c_4082,c_50]) ).
cnf(c_4778,plain,
mult(ld(X0,unit),X0) = rd(X0,X0),
inference(superposition,[status(thm)],[c_4764,c_52]) ).
cnf(c_4829,plain,
mult(ld(X0,unit),X0) = unit,
inference(light_normalisation,[status(thm)],[c_4778,c_171]) ).
cnf(c_5118,plain,
$false,
inference(superposition,[status(thm)],[c_4829,c_153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP700-10 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n025.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 : Thu Jun 20 11:09:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.21/1.13 % SZS status Started for theBenchmark.p
% 3.21/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.21/1.13
% 3.21/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.21/1.13
% 3.21/1.13 ------ iProver source info
% 3.21/1.13
% 3.21/1.13 git: date: 2024-06-12 09:56:46 +0000
% 3.21/1.13 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.21/1.13 git: non_committed_changes: false
% 3.21/1.13
% 3.21/1.13 ------ Parsing...successful
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.21/1.13
% 3.21/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.21/1.13
% 3.21/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.21/1.13 ------ Proving...
% 3.21/1.13 ------ Problem Properties
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 clauses 9
% 3.21/1.13 conjectures 1
% 3.21/1.13 EPR 0
% 3.21/1.13 Horn 9
% 3.21/1.13 unary 9
% 3.21/1.13 binary 0
% 3.21/1.13 lits 9
% 3.21/1.13 lits eq 9
% 3.21/1.13 fd_pure 0
% 3.21/1.13 fd_pseudo 0
% 3.21/1.13 fd_cond 0
% 3.21/1.13 fd_pseudo_cond 0
% 3.21/1.13 AC symbols 0
% 3.21/1.13
% 3.21/1.13 ------ Input Options Time Limit: Unbounded
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 ------
% 3.21/1.13 Current options:
% 3.21/1.13 ------
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 ------ Proving...
% 3.21/1.13
% 3.21/1.13
% 3.21/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.21/1.13
% 3.21/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.21/1.13
% 3.21/1.13
%------------------------------------------------------------------------------