TSTP Solution File: GRP182-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP182-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:38 EDT 2024
% Result : Unsatisfiable 0.96s 1.21s
% Output : CNFRefutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 7 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
greatest_lower_bound(identity,least_upper_bound(a,identity)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p17b) ).
cnf(c_50,plain,
greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(c_51,plain,
least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(c_52,plain,
greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(c_53,plain,
least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(c_57,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_80,negated_conjecture,
greatest_lower_bound(identity,least_upper_bound(identity,a)) != identity,
inference(theory_normalisation,[status(thm)],[c_49,c_52,c_50,c_53,c_51]) ).
cnf(c_97,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_80,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP182-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 00:06:19 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running UEQ theorem proving
% 0.22/0.48 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
% 0.96/1.21 % SZS status Started for theBenchmark.p
% 0.96/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.96/1.21
% 0.96/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.96/1.21
% 0.96/1.21 ------ iProver source info
% 0.96/1.21
% 0.96/1.21 git: date: 2024-05-02 19:28:25 +0000
% 0.96/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.96/1.21 git: non_committed_changes: false
% 0.96/1.21
% 0.96/1.21 ------ Parsing...successful
% 0.96/1.21
% 0.96/1.21
% 0.96/1.21
% 0.96/1.21 ------ Preprocessing...
% 0.96/1.21
% 0.96/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.96/1.21
% 0.96/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.96/1.21
% 0.96/1.21
%------------------------------------------------------------------------------