TSTP Solution File: GRP159-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP159-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:22 EDT 2024
% Result : Unsatisfiable 0.45s 1.14s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 7 RR)
% Number of literals : 14 ( 13 equ; 3 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 : 17 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono2c_1) ).
cnf(c_50,negated_conjecture,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono2c) ).
cnf(c_51,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_52,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_53,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_54,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,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(c_59,plain,
least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(c_115,plain,
multiply(c,least_upper_bound(a,b)) != multiply(c,b),
inference(ac_demodulation,[status(thm)],[c_50,c_59,c_53,c_51,c_54,c_52]) ).
cnf(c_207,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_51,c_57]) ).
cnf(c_246,plain,
least_upper_bound(b,a) = b,
inference(superposition,[status(thm)],[c_49,c_207]) ).
cnf(c_257,plain,
least_upper_bound(a,b) = b,
inference(theory_normalisation,[status(thm)],[c_246,c_53,c_51,c_54,c_52]) ).
cnf(c_259,plain,
multiply(c,b) != multiply(c,b),
inference(demodulation,[status(thm)],[c_115,c_257]) ).
cnf(c_260,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_259]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP159-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n027.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 10:19:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.14 % SZS status Started for theBenchmark.p
% 0.45/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.14
% 0.45/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.14
% 0.45/1.14 ------ iProver source info
% 0.45/1.14
% 0.45/1.14 git: date: 2024-06-12 09:56:46 +0000
% 0.45/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.45/1.14 git: non_committed_changes: false
% 0.45/1.14
% 0.45/1.14 ------ Parsing...successful
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing... sup_sim: 3 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.14
% 0.45/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.45/1.14 ------ Proving...
% 0.45/1.14 ------ Problem Properties
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 clauses 17
% 0.45/1.14 conjectures 0
% 0.45/1.14 EPR 0
% 0.45/1.14 Horn 17
% 0.45/1.14 unary 17
% 0.45/1.14 binary 0
% 0.45/1.14 lits 17
% 0.45/1.14 lits eq 17
% 0.45/1.14 fd_pure 0
% 0.45/1.14 fd_pseudo 0
% 0.45/1.14 fd_cond 0
% 0.45/1.14 fd_pseudo_cond 0
% 0.45/1.14 AC symbols 2
% 0.45/1.14
% 0.45/1.14 ------ Input Options Time Limit: Unbounded
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 ------
% 0.45/1.14 Current options:
% 0.45/1.14 ------
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 ------ Proving...
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.14
% 0.45/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.14
% 0.45/1.14
%------------------------------------------------------------------------------