TSTP Solution File: GRP680-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP680-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : Thu Aug 31 01:01:21 EDT 2023
% Result : Unsatisfiable 4.10s 1.16s
% Output : CNFRefutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 5 RR)
% Number of literals : 32 ( 31 equ; 4 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; 3 con; 0-2 aty)
% Number of variables : 42 ( 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_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(X1,X0)),X2) = mult(X0,mult(X1,mult(X0,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c_56,plain,
mult(i(X0),mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c_57,plain,
mult(X0,op_c) = mult(op_c,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c_58,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_183,plain,
ld(i(X0),X1) = mult(X0,X1),
inference(superposition,[status(thm)],[c_56,c_50]) ).
cnf(c_345,plain,
ld(X0,X0) = unit,
inference(superposition,[status(thm)],[c_53,c_50]) ).
cnf(c_366,plain,
mult(i(X0),X1) = ld(X0,X1),
inference(superposition,[status(thm)],[c_49,c_56]) ).
cnf(c_368,plain,
mult(i(X0),X0) = unit,
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_373,plain,
rd(X0,mult(X1,X0)) = i(X1),
inference(superposition,[status(thm)],[c_56,c_52]) ).
cnf(c_385,plain,
mult(X0,mult(X1,mult(X0,op_c))) = mult(op_c,mult(X0,mult(X1,X0))),
inference(superposition,[status(thm)],[c_57,c_55]) ).
cnf(c_399,plain,
ld(i(X0),ld(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_183,c_49]) ).
cnf(c_401,plain,
rd(ld(i(X0),X1),X1) = X0,
inference(superposition,[status(thm)],[c_183,c_52]) ).
cnf(c_404,plain,
ld(i(X0),unit) = X0,
inference(superposition,[status(thm)],[c_183,c_53]) ).
cnf(c_412,plain,
ld(i(i(op_c)),a) != mult(a,i(op_c)),
inference(superposition,[status(thm)],[c_183,c_58]) ).
cnf(c_414,plain,
ld(i(i(X0)),X0) = unit,
inference(demodulation,[status(thm)],[c_368,c_183]) ).
cnf(c_427,plain,
rd(X0,ld(i(X1),X0)) = i(X1),
inference(demodulation,[status(thm)],[c_373,c_183]) ).
cnf(c_429,plain,
ld(i(i(X0)),X1) = ld(X0,X1),
inference(demodulation,[status(thm)],[c_366,c_183]) ).
cnf(c_435,plain,
mult(a,i(op_c)) != ld(op_c,a),
inference(demodulation,[status(thm)],[c_412,c_429]) ).
cnf(c_436,plain,
ld(i(a),i(op_c)) != ld(op_c,a),
inference(demodulation,[status(thm)],[c_435,c_183]) ).
cnf(c_439,plain,
ld(i(X0),ld(i(X1),ld(i(X0),op_c))) = ld(i(op_c),ld(i(X0),ld(i(X1),X0))),
inference(demodulation,[status(thm)],[c_385,c_183]) ).
cnf(c_527,plain,
rd(unit,i(X0)) = X0,
inference(superposition,[status(thm)],[c_345,c_401]) ).
cnf(c_678,plain,
rd(unit,X0) = i(X0),
inference(superposition,[status(thm)],[c_404,c_427]) ).
cnf(c_746,plain,
ld(X0,unit) = i(X0),
inference(superposition,[status(thm)],[c_429,c_404]) ).
cnf(c_935,plain,
ld(i(op_c),ld(i(i(op_c)),ld(i(X0),i(op_c)))) = ld(i(i(op_c)),ld(i(X0),unit)),
inference(superposition,[status(thm)],[c_414,c_439]) ).
cnf(c_1113,plain,
i(i(X0)) = X0,
inference(demodulation,[status(thm)],[c_527,c_678]) ).
cnf(c_1298,plain,
ld(i(op_c),ld(op_c,ld(i(X0),i(op_c)))) = ld(op_c,X0),
inference(demodulation,[status(thm)],[c_935,c_746,c_1113]) ).
cnf(c_1299,plain,
ld(i(X0),i(op_c)) = ld(op_c,X0),
inference(demodulation,[status(thm)],[c_1298,c_399]) ).
cnf(c_1402,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_436,c_1299]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP680-1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 01:04:43 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running UEQ theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.10/1.16 % SZS status Started for theBenchmark.p
% 4.10/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 4.10/1.16
% 4.10/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.10/1.16
% 4.10/1.16 ------ iProver source info
% 4.10/1.16
% 4.10/1.16 git: date: 2023-05-31 18:12:56 +0000
% 4.10/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.10/1.16 git: non_committed_changes: false
% 4.10/1.16 git: last_make_outside_of_git: false
% 4.10/1.16
% 4.10/1.16 ------ Parsing...successful
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.10/1.16
% 4.10/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.10/1.16
% 4.10/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.10/1.16 ------ Proving...
% 4.10/1.16 ------ Problem Properties
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16 clauses 10
% 4.10/1.16 conjectures 1
% 4.10/1.16 EPR 0
% 4.10/1.16 Horn 10
% 4.10/1.16 unary 10
% 4.10/1.16 binary 0
% 4.10/1.16 lits 10
% 4.10/1.16 lits eq 10
% 4.10/1.16 fd_pure 0
% 4.10/1.16 fd_pseudo 0
% 4.10/1.16 fd_cond 0
% 4.10/1.16 fd_pseudo_cond 0
% 4.10/1.16 AC symbols 0
% 4.10/1.16
% 4.10/1.16 ------ Input Options Time Limit: Unbounded
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16 ------
% 4.10/1.16 Current options:
% 4.10/1.16 ------
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16 ------ Proving...
% 4.10/1.16
% 4.10/1.16
% 4.10/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 4.10/1.16
% 4.10/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.10/1.16
% 4.10/1.16
%------------------------------------------------------------------------------