TSTP Solution File: GRP175-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP175-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:21:35 EDT 2024
% Result : Unsatisfiable 4.13s 1.22s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 7 RR)
% Number of literals : 13 ( 12 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p06b_1) ).
cnf(c_50,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p06b) ).
cnf(c_60,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(c_62,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(c_63,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_64,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_327,plain,
multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[status(thm)],[c_64,c_60]) ).
cnf(c_340,plain,
multiply(inverse(a),greatest_lower_bound(a,multiply(b,a))) != identity,
inference(demodulation,[status(thm)],[c_50,c_327]) ).
cnf(c_382,plain,
greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_63,c_62]) ).
cnf(c_2031,plain,
multiply(inverse(a),multiply(greatest_lower_bound(identity,b),a)) != identity,
inference(demodulation,[status(thm)],[c_340,c_382]) ).
cnf(c_2032,plain,
multiply(inverse(a),multiply(identity,a)) != identity,
inference(light_normalisation,[status(thm)],[c_2031,c_49]) ).
cnf(c_2193,plain,
multiply(inverse(a),a) != identity,
inference(superposition,[status(thm)],[c_63,c_2032]) ).
cnf(c_2194,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2193,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP175-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.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 : Fri May 3 00:06:36 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running UEQ theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.13/1.22 % SZS status Started for theBenchmark.p
% 4.13/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 4.13/1.22
% 4.13/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.13/1.22
% 4.13/1.22 ------ iProver source info
% 4.13/1.22
% 4.13/1.22 git: date: 2024-05-02 19:28:25 +0000
% 4.13/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.13/1.22 git: non_committed_changes: false
% 4.13/1.22
% 4.13/1.22 ------ Parsing...successful
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.13/1.22
% 4.13/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.13/1.22
% 4.13/1.22 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.13/1.22 ------ Proving...
% 4.13/1.22 ------ Problem Properties
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22 clauses 17
% 4.13/1.22 conjectures 1
% 4.13/1.22 EPR 0
% 4.13/1.22 Horn 17
% 4.13/1.22 unary 17
% 4.13/1.22 binary 0
% 4.13/1.22 lits 17
% 4.13/1.22 lits eq 17
% 4.13/1.22 fd_pure 0
% 4.13/1.22 fd_pseudo 0
% 4.13/1.22 fd_cond 0
% 4.13/1.22 fd_pseudo_cond 0
% 4.13/1.22 AC symbols 2
% 4.13/1.22
% 4.13/1.22 ------ Input Options Time Limit: Unbounded
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22 ------
% 4.13/1.22 Current options:
% 4.13/1.22 ------
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22 ------ Proving...
% 4.13/1.22
% 4.13/1.22
% 4.13/1.22 % SZS status Unsatisfiable for theBenchmark.p
% 4.13/1.22
% 4.13/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.13/1.22
% 4.13/1.22
%------------------------------------------------------------------------------