TSTP Solution File: GRP172-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP172-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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 06:58:28 EDT 2024
% Result : Unsatisfiable 3.18s 1.14s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 11 RR)
% Number of literals : 26 ( 25 equ; 1 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 : 31 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
greatest_lower_bound(identity,a) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p04d_1) ).
cnf(c_50,plain,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p04d_2) ).
cnf(c_51,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p04d) ).
cnf(c_52,plain,
greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(c_53,plain,
least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(c_54,plain,
greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(c_55,plain,
least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(c_58,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(c_59,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_62,plain,
least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(c_64,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_193,plain,
least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[status(thm)],[c_55,c_53]) ).
cnf(c_211,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_52,c_58]) ).
cnf(c_222,plain,
greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2))) = X0,
inference(superposition,[status(thm)],[c_193,c_59]) ).
cnf(c_241,plain,
least_upper_bound(a,identity) = a,
inference(superposition,[status(thm)],[c_49,c_211]) ).
cnf(c_242,plain,
least_upper_bound(b,identity) = b,
inference(superposition,[status(thm)],[c_50,c_211]) ).
cnf(c_251,plain,
least_upper_bound(identity,b) = b,
inference(theory_normalisation,[status(thm)],[c_242,c_54,c_52,c_55,c_53]) ).
cnf(c_252,plain,
least_upper_bound(identity,a) = a,
inference(theory_normalisation,[status(thm)],[c_241,c_54,c_52,c_55,c_53]) ).
cnf(c_331,plain,
greatest_lower_bound(identity,least_upper_bound(X0,b)) = identity,
inference(superposition,[status(thm)],[c_251,c_222]) ).
cnf(c_379,plain,
greatest_lower_bound(identity,least_upper_bound(b,X0)) = identity,
inference(superposition,[status(thm)],[c_53,c_331]) ).
cnf(c_1004,plain,
least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_64,c_62]) ).
cnf(c_9170,plain,
greatest_lower_bound(identity,multiply(least_upper_bound(identity,X0),b)) = identity,
inference(superposition,[status(thm)],[c_1004,c_379]) ).
cnf(c_9739,plain,
greatest_lower_bound(identity,multiply(a,b)) = identity,
inference(superposition,[status(thm)],[c_252,c_9170]) ).
cnf(c_9911,plain,
least_upper_bound(multiply(a,b),identity) = multiply(a,b),
inference(superposition,[status(thm)],[c_9739,c_211]) ).
cnf(c_9934,plain,
least_upper_bound(identity,multiply(a,b)) = multiply(a,b),
inference(theory_normalisation,[status(thm)],[c_9911,c_54,c_52,c_55,c_53]) ).
cnf(c_9935,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9934,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP172-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 09:45:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/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
% 3.18/1.14 % SZS status Started for theBenchmark.p
% 3.18/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.18/1.14
% 3.18/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.18/1.14
% 3.18/1.14 ------ iProver source info
% 3.18/1.14
% 3.18/1.14 git: date: 2024-06-12 09:56:46 +0000
% 3.18/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.18/1.14 git: non_committed_changes: false
% 3.18/1.14
% 3.18/1.14 ------ Parsing...successful
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.18/1.14
% 3.18/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.18/1.14
% 3.18/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.18/1.14 ------ Proving...
% 3.18/1.14 ------ Problem Properties
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14 clauses 18
% 3.18/1.14 conjectures 1
% 3.18/1.14 EPR 0
% 3.18/1.14 Horn 18
% 3.18/1.14 unary 18
% 3.18/1.14 binary 0
% 3.18/1.14 lits 18
% 3.18/1.14 lits eq 18
% 3.18/1.14 fd_pure 0
% 3.18/1.14 fd_pseudo 0
% 3.18/1.14 fd_cond 0
% 3.18/1.14 fd_pseudo_cond 0
% 3.18/1.14 AC symbols 2
% 3.18/1.14
% 3.18/1.14 ------ Input Options Time Limit: Unbounded
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14 ------
% 3.18/1.14 Current options:
% 3.18/1.14 ------
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14 ------ Proving...
% 3.18/1.14
% 3.18/1.14
% 3.18/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 3.18/1.14
% 3.18/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.18/1.14
% 3.18/1.14
%------------------------------------------------------------------------------