TSTP Solution File: GRP165-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP165-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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.95s 1.01s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
least_upper_bound(a,identity) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat1a_1) ).
cnf(c_50,negated_conjecture,
least_upper_bound(a,multiply(a,a)) != multiply(a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat1a) ).
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_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_63,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_64,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_65,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_120,plain,
multiply(a,a) = sP0_iProver_def,
definition ).
cnf(c_121,plain,
least_upper_bound(a,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_122,negated_conjecture,
sP1_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_50,c_120,c_121]) ).
cnf(c_200,plain,
least_upper_bound(sP0_iProver_def,a) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_121,c_54,c_52,c_53,c_51]) ).
cnf(c_497,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_64,c_65]) ).
cnf(c_503,plain,
least_upper_bound(sP0_iProver_def,multiply(a,X0)) = multiply(a,least_upper_bound(a,X0)),
inference(superposition,[status(thm)],[c_120,c_59]) ).
cnf(c_5521,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_497,c_63]) ).
cnf(c_5524,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_64,c_5521]) ).
cnf(c_5529,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_5521,c_5521]) ).
cnf(c_5699,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_5524,c_5529]) ).
cnf(c_8317,plain,
multiply(a,least_upper_bound(a,identity)) = least_upper_bound(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_5699,c_503]) ).
cnf(c_8334,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_8317,c_49,c_120,c_200]) ).
cnf(c_8399,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_122,c_8334]) ).
cnf(c_8400,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_8399]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP165-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.08 % Command : run_iprover %s %d THM
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Fri May 3 00:02:23 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.35 Running UEQ theorem proving
% 0.11/0.35 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
% 2.95/1.01 % SZS status Started for theBenchmark.p
% 2.95/1.01 % SZS status Unsatisfiable for theBenchmark.p
% 2.95/1.01
% 2.95/1.01 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.95/1.01
% 2.95/1.01 ------ iProver source info
% 2.95/1.01
% 2.95/1.01 git: date: 2024-05-02 19:28:25 +0000
% 2.95/1.01 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.95/1.01 git: non_committed_changes: false
% 2.95/1.01
% 2.95/1.01 ------ Parsing...successful
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.95/1.01
% 2.95/1.01 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.95/1.01
% 2.95/1.01 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.95/1.01 ------ Proving...
% 2.95/1.01 ------ Problem Properties
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01 clauses 19
% 2.95/1.01 conjectures 1
% 2.95/1.01 EPR 1
% 2.95/1.01 Horn 19
% 2.95/1.01 unary 19
% 2.95/1.01 binary 0
% 2.95/1.01 lits 19
% 2.95/1.01 lits eq 19
% 2.95/1.01 fd_pure 0
% 2.95/1.01 fd_pseudo 0
% 2.95/1.01 fd_cond 0
% 2.95/1.01 fd_pseudo_cond 0
% 2.95/1.01 AC symbols 2
% 2.95/1.01
% 2.95/1.01 ------ Input Options Time Limit: Unbounded
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01 ------
% 2.95/1.01 Current options:
% 2.95/1.01 ------
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01 ------ Proving...
% 2.95/1.01
% 2.95/1.01
% 2.95/1.01 % SZS status Unsatisfiable for theBenchmark.p
% 2.95/1.01
% 2.95/1.01 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.95/1.01
% 2.95/1.01
%------------------------------------------------------------------------------