TSTP Solution File: GRP185-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP185-1 : 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:39 EDT 2024
% Result : Unsatisfiable 3.89s 1.12s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 7 RR)
% Number of literals : 16 ( 15 equ; 6 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p22a) ).
cnf(c_50,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_51,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_52,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_53,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_54,plain,
least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).
cnf(c_58,plain,
least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(c_60,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_62,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_80,negated_conjecture,
least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)))) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)),
inference(theory_normalisation,[status(thm)],[c_49,c_52,c_50,c_53,c_51]) ).
cnf(c_113,plain,
least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(least_upper_bound(identity,b),least_upper_bound(multiply(a,identity),multiply(a,b))))) != least_upper_bound(least_upper_bound(identity,b),least_upper_bound(multiply(a,identity),multiply(a,b))),
inference(demodulation,[status(thm)],[c_80,c_58,c_60,c_62]) ).
cnf(c_186,plain,
least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_603,plain,
least_upper_bound(identity,least_upper_bound(identity,least_upper_bound(b,least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),multiply(a,b)))))) != least_upper_bound(identity,least_upper_bound(b,least_upper_bound(multiply(a,identity),multiply(a,b)))),
inference(theory_normalisation,[status(thm)],[c_113,c_53,c_51,c_52,c_50]) ).
cnf(c_604,plain,
least_upper_bound(b,least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(a,identity)))) != least_upper_bound(identity,least_upper_bound(b,least_upper_bound(multiply(a,identity),multiply(a,b)))),
inference(ac_demodulation,[status(thm)],[c_603,c_54,c_53,c_51,c_52,c_50]) ).
cnf(c_607,plain,
least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(a,identity)))) != least_upper_bound(identity,least_upper_bound(b,least_upper_bound(multiply(a,identity),multiply(a,b)))),
inference(superposition,[status(thm)],[c_186,c_604]) ).
cnf(c_699,plain,
$false,
inference(theory_normalisation,[status(thm)],[c_607,c_53,c_51,c_52,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP185-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n026.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:19:36 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running UEQ theorem proving
% 0.17/0.43 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.89/1.12 % SZS status Started for theBenchmark.p
% 3.89/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.89/1.12
% 3.89/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.89/1.12
% 3.89/1.12 ------ iProver source info
% 3.89/1.12
% 3.89/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.89/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.89/1.12 git: non_committed_changes: false
% 3.89/1.12
% 3.89/1.12 ------ Parsing...successful
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.89/1.12
% 3.89/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.89/1.12
% 3.89/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.89/1.12 ------ Proving...
% 3.89/1.12 ------ Problem Properties
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 clauses 16
% 3.89/1.12 conjectures 0
% 3.89/1.12 EPR 0
% 3.89/1.12 Horn 16
% 3.89/1.12 unary 16
% 3.89/1.12 binary 0
% 3.89/1.12 lits 16
% 3.89/1.12 lits eq 16
% 3.89/1.12 fd_pure 0
% 3.89/1.12 fd_pseudo 0
% 3.89/1.12 fd_cond 0
% 3.89/1.12 fd_pseudo_cond 0
% 3.89/1.12 AC symbols 2
% 3.89/1.12
% 3.89/1.12 ------ Input Options Time Limit: Unbounded
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 ------
% 3.89/1.12 Current options:
% 3.89/1.12 ------
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 ------ Proving...
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.89/1.12
% 3.89/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.89/1.12
% 3.89/1.12
%------------------------------------------------------------------------------