TSTP Solution File: GRP687-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP687-1 : TPTP v8.2.0. Released v4.0.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:48 EDT 2024
% Result : Unsatisfiable 0.49s 1.17s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 2 RR)
% Number of literals : 32 ( 31 equ; 1 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c_51,plain,
mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c_53,plain,
mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c_55,plain,
mult(mult(X0,mult(X0,X1)),X2) = mult(mult(X0,X0),mult(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c_56,negated_conjecture,
mult(mult(a,mult(b,b)),c) != mult(a,mult(b,mult(b,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_143,plain,
ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_148,plain,
rd(X0,ld(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_158,plain,
mult(mult(X0,X0),mult(ld(X0,X1),X2)) = mult(mult(X0,X1),X2),
inference(superposition,[status(thm)],[c_49,c_55]) ).
cnf(c_165,plain,
rd(mult(mult(X0,X0),mult(X1,X2)),X2) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_55,c_52]) ).
cnf(c_167,plain,
mult(mult(X0,X0),mult(X1,unit)) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_55,c_53]) ).
cnf(c_191,plain,
mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_167,c_53]) ).
cnf(c_343,plain,
mult(X0,mult(X0,mult(ld(X0,X1),X2))) = mult(mult(X0,X1),X2),
inference(demodulation,[status(thm)],[c_158,c_191]) ).
cnf(c_348,plain,
mult(mult(X0,X1),ld(ld(X0,X1),X2)) = mult(X0,mult(X0,X2)),
inference(superposition,[status(thm)],[c_49,c_343]) ).
cnf(c_673,plain,
rd(mult(X0,mult(X0,mult(X1,X2))),X2) = mult(X0,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_165,c_191]) ).
cnf(c_683,plain,
mult(X0,mult(X0,rd(X1,X2))) = rd(mult(X0,mult(X0,X1)),X2),
inference(superposition,[status(thm)],[c_51,c_673]) ).
cnf(c_880,plain,
mult(X0,ld(ld(X1,ld(X1,X0)),X2)) = mult(X1,mult(X1,X2)),
inference(superposition,[status(thm)],[c_49,c_348]) ).
cnf(c_882,plain,
mult(X0,ld(ld(X0,unit),X1)) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_53,c_348]) ).
cnf(c_995,plain,
ld(X0,mult(X0,mult(X0,X1))) = ld(ld(X0,unit),X1),
inference(superposition,[status(thm)],[c_882,c_50]) ).
cnf(c_1076,plain,
ld(ld(X0,unit),X1) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_995,c_50]) ).
cnf(c_1082,plain,
mult(rd(unit,X0),X1) = ld(X0,X1),
inference(superposition,[status(thm)],[c_143,c_1076]) ).
cnf(c_1166,plain,
ld(X0,unit) = rd(unit,X0),
inference(superposition,[status(thm)],[c_1082,c_53]) ).
cnf(c_2808,plain,
mult(X0,mult(X0,rd(unit,X1))) = rd(mult(X0,X0),X1),
inference(superposition,[status(thm)],[c_53,c_683]) ).
cnf(c_3027,plain,
mult(X0,mult(X0,ld(X1,unit))) = rd(mult(X0,X0),X1),
inference(demodulation,[status(thm)],[c_2808,c_1166]) ).
cnf(c_3057,plain,
ld(X0,rd(mult(X0,X0),X1)) = mult(X0,ld(X1,unit)),
inference(superposition,[status(thm)],[c_3027,c_50]) ).
cnf(c_3711,plain,
mult(X0,ld(ld(X1,mult(X0,X0)),unit)) = ld(X0,X1),
inference(superposition,[status(thm)],[c_148,c_3057]) ).
cnf(c_4096,plain,
ld(ld(X0,mult(X1,X1)),unit) = ld(X1,ld(X1,X0)),
inference(superposition,[status(thm)],[c_3711,c_50]) ).
cnf(c_4255,plain,
ld(ld(X0,ld(X0,X1)),X2) = mult(ld(X1,mult(X0,X0)),X2),
inference(superposition,[status(thm)],[c_4096,c_1076]) ).
cnf(c_4942,plain,
mult(X0,mult(ld(X0,mult(X1,X1)),X2)) = mult(X1,mult(X1,X2)),
inference(demodulation,[status(thm)],[c_880,c_4255]) ).
cnf(c_4992,plain,
mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(superposition,[status(thm)],[c_4942,c_343]) ).
cnf(c_5005,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_4992]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP687-1 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Jun 20 08:29:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.22/0.50 Running UEQ theorem proving
% 0.22/0.50 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
% 0.49/1.17 % SZS status Started for theBenchmark.p
% 0.49/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.17
% 0.49/1.17 ------ iProver source info
% 0.49/1.17
% 0.49/1.17 git: date: 2024-06-12 09:56:46 +0000
% 0.49/1.17 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.49/1.17 git: non_committed_changes: false
% 0.49/1.17
% 0.49/1.17 ------ Parsing...successful
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.49/1.17 ------ Proving...
% 0.49/1.17 ------ Problem Properties
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 clauses 8
% 0.49/1.17 conjectures 1
% 0.49/1.17 EPR 0
% 0.49/1.17 Horn 8
% 0.49/1.17 unary 8
% 0.49/1.17 binary 0
% 0.49/1.17 lits 8
% 0.49/1.17 lits eq 8
% 0.49/1.17 fd_pure 0
% 0.49/1.17 fd_pseudo 0
% 0.49/1.17 fd_cond 0
% 0.49/1.17 fd_pseudo_cond 0
% 0.49/1.17 AC symbols 0
% 0.49/1.17
% 0.49/1.17 ------ Input Options Time Limit: Unbounded
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------
% 0.49/1.17 Current options:
% 0.49/1.17 ------
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------ Proving...
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.17
% 0.49/1.17
%------------------------------------------------------------------------------