TSTP Solution File: GRP659-10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP659-10 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:35 EDT 2024
% Result : Unsatisfiable 0.44s 1.13s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of clauses : 49 ( 49 unt; 0 nHn; 4 RR)
% Number of literals : 49 ( 48 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 98 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
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(mult(X0,mult(X1,X2)),X1) = mult(mult(X0,X1),mult(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(c_54,negated_conjecture,
tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_79,negated_conjecture,
tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_131,plain,
ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_133,plain,
rd(X0,ld(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_49,c_52]) ).
cnf(c_139,plain,
mult(mult(rd(X0,mult(X1,X2)),X1),mult(X2,X1)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_51,c_53]) ).
cnf(c_141,plain,
mult(mult(X0,X1),mult(ld(X1,X2),X1)) = mult(mult(X0,X2),X1),
inference(superposition,[status(thm)],[c_49,c_53]) ).
cnf(c_164,plain,
mult(rd(X0,mult(X1,X2)),X1) = rd(mult(X0,X1),mult(X2,X1)),
inference(superposition,[status(thm)],[c_139,c_52]) ).
cnf(c_184,plain,
mult(mult(rd(X0,X1),X2),X1) = mult(X0,mult(ld(X1,X2),X1)),
inference(superposition,[status(thm)],[c_51,c_141]) ).
cnf(c_192,plain,
ld(mult(X0,X1),mult(mult(X0,X2),X1)) = mult(ld(X1,X2),X1),
inference(superposition,[status(thm)],[c_141,c_50]) ).
cnf(c_320,plain,
mult(rd(rd(X0,X1),mult(X1,X2)),X1) = rd(X0,mult(X2,X1)),
inference(superposition,[status(thm)],[c_51,c_164]) ).
cnf(c_374,plain,
mult(X0,mult(ld(X1,X1),X1)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_51,c_184]) ).
cnf(c_424,plain,
ld(X0,mult(X0,X1)) = mult(ld(X1,X1),X1),
inference(superposition,[status(thm)],[c_374,c_50]) ).
cnf(c_443,plain,
mult(ld(X0,X0),X0) = X0,
inference(light_normalisation,[status(thm)],[c_424,c_50]) ).
cnf(c_478,plain,
ld(X0,X0) = rd(X0,X0),
inference(superposition,[status(thm)],[c_443,c_52]) ).
cnf(c_503,plain,
ld(mult(X0,X1),mult(X0,X1)) = mult(rd(X0,mult(X1,X0)),X1),
inference(superposition,[status(thm)],[c_478,c_164]) ).
cnf(c_522,plain,
ld(mult(X0,X1),mult(X2,X1)) = mult(ld(X1,ld(X0,X2)),X1),
inference(superposition,[status(thm)],[c_49,c_192]) ).
cnf(c_879,plain,
rd(rd(X0,mult(X1,X2)),X2) = rd(rd(X0,X2),mult(X2,X1)),
inference(superposition,[status(thm)],[c_320,c_52]) ).
cnf(c_1098,plain,
mult(ld(X0,ld(X1,ld(X0,X0))),X0) = ld(mult(X1,X0),X0),
inference(superposition,[status(thm)],[c_443,c_522]) ).
cnf(c_1596,plain,
rd(mult(X0,X1),mult(rd(X0,mult(X1,X0)),X1)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_503,c_133]) ).
cnf(c_3829,plain,
rd(rd(mult(X0,X1),X1),mult(X1,rd(X0,mult(X1,X0)))) = rd(mult(X0,X1),X1),
inference(superposition,[status(thm)],[c_1596,c_879]) ).
cnf(c_3845,plain,
rd(X0,mult(X1,rd(X0,mult(X1,X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_3829,c_52]) ).
cnf(c_4038,plain,
rd(X0,mult(rd(X1,X0),rd(X0,X1))) = X0,
inference(superposition,[status(thm)],[c_51,c_3845]) ).
cnf(c_4215,plain,
rd(X0,mult(rd(ld(X1,X0),X0),X1)) = X0,
inference(superposition,[status(thm)],[c_133,c_4038]) ).
cnf(c_4238,plain,
mult(rd(X0,X1),rd(X1,X0)) = ld(X1,X1),
inference(superposition,[status(thm)],[c_4038,c_131]) ).
cnf(c_4648,plain,
mult(rd(ld(X0,X1),X1),X0) = ld(X1,X1),
inference(superposition,[status(thm)],[c_4215,c_131]) ).
cnf(c_4735,plain,
rd(ld(X0,X0),rd(X0,X1)) = rd(X1,X0),
inference(superposition,[status(thm)],[c_4238,c_52]) ).
cnf(c_4736,plain,
ld(rd(X0,X1),ld(X1,X1)) = rd(X1,X0),
inference(superposition,[status(thm)],[c_4238,c_50]) ).
cnf(c_4997,plain,
rd(ld(X0,X0),X1) = rd(ld(X1,X0),X0),
inference(superposition,[status(thm)],[c_4648,c_52]) ).
cnf(c_5175,plain,
ld(mult(rd(X0,X1),X1),X1) = mult(ld(X1,rd(X1,X0)),X1),
inference(superposition,[status(thm)],[c_4736,c_1098]) ).
cnf(c_5178,plain,
mult(ld(X0,rd(X0,X1)),X0) = ld(X1,X0),
inference(light_normalisation,[status(thm)],[c_5175,c_51]) ).
cnf(c_5631,plain,
ld(X0,rd(X0,X1)) = rd(ld(X1,X0),X0),
inference(superposition,[status(thm)],[c_5178,c_52]) ).
cnf(c_5667,plain,
ld(X0,rd(X0,X1)) = rd(ld(X0,X0),X1),
inference(demodulation,[status(thm)],[c_4997,c_5631]) ).
cnf(c_5668,plain,
ld(X0,rd(X0,rd(X0,X1))) = rd(X1,X0),
inference(demodulation,[status(thm)],[c_4735,c_5667]) ).
cnf(c_5971,plain,
ld(X0,rd(X0,ld(X1,ld(X0,X0)))) = X1,
inference(superposition,[status(thm)],[c_5667,c_133]) ).
cnf(c_5984,plain,
ld(ld(X0,X0),ld(X0,X0)) = ld(X0,rd(X0,ld(X0,X0))),
inference(superposition,[status(thm)],[c_5667,c_478]) ).
cnf(c_6110,plain,
ld(X0,rd(X0,ld(X0,X0))) = ld(X0,X0),
inference(superposition,[status(thm)],[c_478,c_5668]) ).
cnf(c_6415,plain,
ld(ld(X0,X0),ld(X0,rd(X0,ld(X1,ld(ld(X0,X0),ld(X0,X0)))))) = X1,
inference(superposition,[status(thm)],[c_5667,c_5971]) ).
cnf(c_6447,plain,
ld(ld(X0,X0),X1) = X1,
inference(light_normalisation,[status(thm)],[c_6415,c_5971,c_5984,c_6110]) ).
cnf(c_6482,plain,
mult(ld(X0,X0),X1) = X1,
inference(superposition,[status(thm)],[c_6447,c_49]) ).
cnf(c_6487,plain,
ld(X0,X0) = rd(X1,X1),
inference(superposition,[status(thm)],[c_6447,c_133]) ).
cnf(c_6588,plain,
tuple(x1(ld(X0,X0)),mult(x1_2(ld(X0,X0)),ld(X0,X0))) != tuple(x1(ld(X0,X0)),x1_2(ld(X0,X0))),
inference(superposition,[status(thm)],[c_6482,c_79]) ).
cnf(c_7031,plain,
mult(X0,rd(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_6487,c_49]) ).
cnf(c_7146,plain,
mult(X0,ld(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_6487,c_7031]) ).
cnf(c_7449,plain,
$false,
inference(ground_joinability,[status(thm)],[c_6588,c_7146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP659-10 : TPTP v8.2.0. Released v8.1.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Jun 20 10:20:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.46 Running UEQ theorem proving
% 0.21/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.44/1.13 % SZS status Started for theBenchmark.p
% 0.44/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.13
% 0.44/1.13 ------ iProver source info
% 0.44/1.13
% 0.44/1.13 git: date: 2024-06-12 09:56:46 +0000
% 0.44/1.13 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.44/1.13 git: non_committed_changes: false
% 0.44/1.13
% 0.44/1.13 ------ Parsing...successful
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.44/1.13 ------ Proving...
% 0.44/1.13 ------ Problem Properties
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 clauses 6
% 0.44/1.13 conjectures 1
% 0.44/1.13 EPR 0
% 0.44/1.13 Horn 6
% 0.44/1.13 unary 6
% 0.44/1.13 binary 0
% 0.44/1.13 lits 6
% 0.44/1.13 lits eq 6
% 0.44/1.13 fd_pure 0
% 0.44/1.13 fd_pseudo 0
% 0.44/1.13 fd_cond 0
% 0.44/1.13 fd_pseudo_cond 0
% 0.44/1.13 AC symbols 0
% 0.44/1.13
% 0.44/1.13 ------ Input Options Time Limit: Unbounded
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 ------
% 0.44/1.13 Current options:
% 0.44/1.13 ------
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 ------ Proving...
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.13
% 0.44/1.13
%------------------------------------------------------------------------------