TSTP Solution File: GRP165-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP165-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:31 EDT 2024
% Result : Unsatisfiable 2.60s 1.14s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
greatest_lower_bound(a,identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat1b_1) ).
cnf(c_50,negated_conjecture,
greatest_lower_bound(a,multiply(a,a)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lat1b) ).
cnf(c_51,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_52,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_53,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_54,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_57,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(c_58,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_59,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_63,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_64,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_65,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_120,plain,
multiply(a,a) = sP0_iProver_def,
definition ).
cnf(c_121,plain,
greatest_lower_bound(a,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_122,negated_conjecture,
sP1_iProver_def != a,
inference(demodulation,[status(thm)],[c_50,c_120,c_121]) ).
cnf(c_200,plain,
greatest_lower_bound(sP0_iProver_def,a) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_121,c_53,c_51,c_54,c_52]) ).
cnf(c_218,plain,
least_upper_bound(a,identity) = a,
inference(superposition,[status(thm)],[c_49,c_57]) ).
cnf(c_226,plain,
greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_52,c_58]) ).
cnf(c_485,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_64,c_65]) ).
cnf(c_491,plain,
multiply(a,least_upper_bound(a,X0)) = least_upper_bound(sP0_iProver_def,multiply(a,X0)),
inference(superposition,[status(thm)],[c_120,c_59]) ).
cnf(c_3965,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_485,c_63]) ).
cnf(c_3968,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_64,c_3965]) ).
cnf(c_3973,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_3965,c_3965]) ).
cnf(c_4212,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_3968,c_3973]) ).
cnf(c_6637,plain,
multiply(a,least_upper_bound(a,identity)) = least_upper_bound(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_4212,c_491]) ).
cnf(c_6655,plain,
least_upper_bound(sP0_iProver_def,a) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_6637,c_120,c_218]) ).
cnf(c_6714,plain,
greatest_lower_bound(a,sP0_iProver_def) = a,
inference(superposition,[status(thm)],[c_6655,c_226]) ).
cnf(c_6733,plain,
greatest_lower_bound(sP0_iProver_def,a) = a,
inference(theory_normalisation,[status(thm)],[c_6714,c_53,c_51,c_54,c_52]) ).
cnf(c_6734,plain,
a = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_6733,c_200]) ).
cnf(c_6798,plain,
sP1_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_122,c_6734]) ).
cnf(c_6799,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_6798]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP165-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 23:50:02 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running UEQ theorem proving
% 0.21/0.47 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
% 2.60/1.14 % SZS status Started for theBenchmark.p
% 2.60/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.60/1.14
% 2.60/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.60/1.14
% 2.60/1.14 ------ iProver source info
% 2.60/1.14
% 2.60/1.14 git: date: 2024-05-02 19:28:25 +0000
% 2.60/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.60/1.14 git: non_committed_changes: false
% 2.60/1.14
% 2.60/1.14 ------ Parsing...successful
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.60/1.14
% 2.60/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.60/1.14
% 2.60/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.60/1.14 ------ Proving...
% 2.60/1.14 ------ Problem Properties
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14 clauses 19
% 2.60/1.14 conjectures 1
% 2.60/1.14 EPR 1
% 2.60/1.14 Horn 19
% 2.60/1.14 unary 19
% 2.60/1.14 binary 0
% 2.60/1.14 lits 19
% 2.60/1.14 lits eq 19
% 2.60/1.14 fd_pure 0
% 2.60/1.14 fd_pseudo 0
% 2.60/1.14 fd_cond 0
% 2.60/1.14 fd_pseudo_cond 0
% 2.60/1.14 AC symbols 2
% 2.60/1.14
% 2.60/1.14 ------ Input Options Time Limit: Unbounded
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14 ------
% 2.60/1.14 Current options:
% 2.60/1.14 ------
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14 ------ Proving...
% 2.60/1.14
% 2.60/1.14
% 2.60/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.60/1.14
% 2.60/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.60/1.14
% 2.60/1.14
%------------------------------------------------------------------------------