TSTP Solution File: GRP710-11 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP710-11 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:32 EDT 2024
% Result : Unsatisfiable 3.86s 1.15s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 8 RR)
% Number of literals : 20 ( 19 equ; 7 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(c_50,plain,
mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(c_51,plain,
mult(mult(mult(X0,X1),X1),X2) = mult(X0,mult(X1,mult(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(c_53,plain,
mult(i(X0),X0) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(c_54,negated_conjecture,
mult(X0,x4) != x3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_75,negated_conjecture,
mult(X0,x4) != x3,
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_124,plain,
mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_125,plain,
mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(mult(X0,X1),X1),mult(X2,mult(X2,X3))),
inference(superposition,[status(thm)],[c_51,c_51]) ).
cnf(c_1045,plain,
mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(demodulation,[status(thm)],[c_124,c_49]) ).
cnf(c_1046,plain,
mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(demodulation,[status(thm)],[c_51,c_1045]) ).
cnf(c_1052,plain,
mult(i(X0),mult(X0,X0)) = mult(unit,X0),
inference(superposition,[status(thm)],[c_53,c_1045]) ).
cnf(c_1062,plain,
mult(X0,mult(x4,x4)) != x3,
inference(superposition,[status(thm)],[c_1045,c_75]) ).
cnf(c_1092,plain,
mult(i(X0),mult(X0,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1052,c_50]) ).
cnf(c_1465,plain,
mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(X0,mult(X1,X1)),mult(X2,mult(X2,X3))),
inference(light_normalisation,[status(thm)],[c_125,c_1045]) ).
cnf(c_1466,plain,
mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,X3))))),
inference(demodulation,[status(thm)],[c_1465,c_1046]) ).
cnf(c_1579,plain,
mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,mult(x4,x4)))))) != x3,
inference(superposition,[status(thm)],[c_1466,c_1062]) ).
cnf(c_2398,plain,
mult(X0,mult(X1,mult(X1,mult(x4,x4)))) != x3,
inference(superposition,[status(thm)],[c_50,c_1579]) ).
cnf(c_2746,plain,
mult(X0,mult(i(x4),x4)) != x3,
inference(superposition,[status(thm)],[c_1092,c_2398]) ).
cnf(c_3321,plain,
X0 != x3,
inference(demodulation,[status(thm)],[c_2746,c_49,c_53]) ).
cnf(c_3322,plain,
$false,
inference(equality_resolution,[status(thm)],[c_3321]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP710-11 : TPTP v8.1.2. Released v8.1.0.
% 0.14/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 00:05:51 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running UEQ theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.86/1.15 % SZS status Started for theBenchmark.p
% 3.86/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.15
% 3.86/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.86/1.15
% 3.86/1.15 ------ iProver source info
% 3.86/1.15
% 3.86/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.86/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.86/1.15 git: non_committed_changes: false
% 3.86/1.15
% 3.86/1.15 ------ Parsing...successful
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.86/1.15
% 3.86/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.86/1.15
% 3.86/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.86/1.15 ------ Proving...
% 3.86/1.15 ------ Problem Properties
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15 clauses 6
% 3.86/1.15 conjectures 1
% 3.86/1.15 EPR 0
% 3.86/1.15 Horn 6
% 3.86/1.15 unary 6
% 3.86/1.15 binary 0
% 3.86/1.15 lits 6
% 3.86/1.15 lits eq 6
% 3.86/1.15 fd_pure 0
% 3.86/1.15 fd_pseudo 0
% 3.86/1.15 fd_cond 0
% 3.86/1.15 fd_pseudo_cond 0
% 3.86/1.15 AC symbols 0
% 3.86/1.15
% 3.86/1.15 ------ Input Options Time Limit: Unbounded
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15 ------
% 3.86/1.15 Current options:
% 3.86/1.15 ------
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15 ------ Proving...
% 3.86/1.15
% 3.86/1.15
% 3.86/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.15
% 3.86/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.86/1.15
% 3.86/1.15
%------------------------------------------------------------------------------