TSTP Solution File: GRP166-3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP166-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:32 EDT 2024
% Result : Unsatisfiable 3.10s 1.12s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 5 RR)
% Number of literals : 13 ( 12 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
least_upper_bound(b,identity) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat3a_2) ).
cnf(c_51,negated_conjecture,
least_upper_bound(a,multiply(b,a)) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lat3a) ).
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_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_82,plain,
least_upper_bound(identity,b) = b,
inference(theory_normalisation,[status(thm)],[c_50,c_54,c_52,c_55,c_53]) ).
cnf(c_484,plain,
least_upper_bound(multiply(identity,X0),multiply(b,X0)) = multiply(b,X0),
inference(superposition,[status(thm)],[c_82,c_62]) ).
cnf(c_556,plain,
least_upper_bound(X0,multiply(b,X0)) = multiply(b,X0),
inference(demodulation,[status(thm)],[c_484,c_64]) ).
cnf(c_895,plain,
least_upper_bound(a,multiply(b,a)) = multiply(b,a),
inference(instantiation,[status(thm)],[c_556]) ).
cnf(c_896,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_895,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP166-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n021.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 May 2 23:59:43 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running UEQ theorem proving
% 0.18/0.45 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
% 3.10/1.12 % SZS status Started for theBenchmark.p
% 3.10/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.10/1.12
% 3.10/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.10/1.12
% 3.10/1.12 ------ iProver source info
% 3.10/1.12
% 3.10/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.10/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.10/1.12 git: non_committed_changes: false
% 3.10/1.12
% 3.10/1.12 ------ Parsing...successful
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.10/1.12
% 3.10/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.10/1.12
% 3.10/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.10/1.12 ------ Proving...
% 3.10/1.12 ------ Problem Properties
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12 clauses 20
% 3.10/1.12 conjectures 1
% 3.10/1.12 EPR 1
% 3.10/1.12 Horn 20
% 3.10/1.12 unary 20
% 3.10/1.12 binary 0
% 3.10/1.12 lits 20
% 3.10/1.12 lits eq 20
% 3.10/1.12 fd_pure 0
% 3.10/1.12 fd_pseudo 0
% 3.10/1.12 fd_cond 0
% 3.10/1.12 fd_pseudo_cond 0
% 3.10/1.12 AC symbols 2
% 3.10/1.12
% 3.10/1.12 ------ Input Options Time Limit: Unbounded
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12 ------
% 3.10/1.12 Current options:
% 3.10/1.12 ------
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12 ------ Proving...
% 3.10/1.12
% 3.10/1.12
% 3.10/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.10/1.12
% 3.10/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.10/1.12
% 3.10/1.12
%------------------------------------------------------------------------------