TSTP Solution File: GRP190-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Thu Aug 31 00:58:36 EDT 2023
% Result : Unsatisfiable 32.09s 4.67s
% Output : CNFRefutation 32.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 6 RR)
% Number of literals : 24 ( 23 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
least_upper_bound(a,b) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p39a_1) ).
cnf(c_50,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p39a) ).
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_61,plain,
least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
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_12990,plain,
least_upper_bound(multiply(a,X0),multiply(b,X0)) = multiply(a,X0),
inference(superposition,[status(thm)],[c_49,c_61]) ).
cnf(c_13022,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_64,c_65]) ).
cnf(c_13060,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_13022,c_63]) ).
cnf(c_13214,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_64,c_13060]) ).
cnf(c_13216,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_13060,c_13060]) ).
cnf(c_13719,plain,
least_upper_bound(multiply(X0,multiply(a,X1)),multiply(X0,multiply(b,X1))) = multiply(X0,multiply(a,X1)),
inference(superposition,[status(thm)],[c_12990,c_59]) ).
cnf(c_14490,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_13216,c_64]) ).
cnf(c_14500,plain,
multiply(X0,identity) = X0,
inference(superposition,[status(thm)],[c_13216,c_13214]) ).
cnf(c_14829,plain,
least_upper_bound(X0,multiply(inverse(a),multiply(b,X0))) = X0,
inference(superposition,[status(thm)],[c_13060,c_13719]) ).
cnf(c_23312,plain,
least_upper_bound(inverse(b),multiply(inverse(a),identity)) = inverse(b),
inference(superposition,[status(thm)],[c_14490,c_14829]) ).
cnf(c_23508,plain,
least_upper_bound(inverse(b),inverse(a)) = inverse(b),
inference(demodulation,[status(thm)],[c_23312,c_14500]) ).
cnf(c_23509,plain,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
inference(theory_normalisation,[status(thm)],[c_23508,c_54,c_52,c_53,c_51]) ).
cnf(c_23819,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_23509]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.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 : Mon Aug 28 21:39:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 32.09/4.67 % SZS status Started for theBenchmark.p
% 32.09/4.67 % SZS status Unsatisfiable for theBenchmark.p
% 32.09/4.67
% 32.09/4.67 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 32.09/4.67
% 32.09/4.67 ------ iProver source info
% 32.09/4.67
% 32.09/4.67 git: date: 2023-05-31 18:12:56 +0000
% 32.09/4.67 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 32.09/4.67 git: non_committed_changes: false
% 32.09/4.67 git: last_make_outside_of_git: false
% 32.09/4.67
% 32.09/4.67 ------ Parsing...successful
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 32.09/4.67
% 32.09/4.67 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 32.09/4.67
% 32.09/4.67 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 32.09/4.67 ------ Proving...
% 32.09/4.67 ------ Problem Properties
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67 clauses 17
% 32.09/4.67 conjectures 1
% 32.09/4.67 EPR 0
% 32.09/4.67 Horn 17
% 32.09/4.67 unary 17
% 32.09/4.67 binary 0
% 32.09/4.67 lits 17
% 32.09/4.67 lits eq 17
% 32.09/4.67 fd_pure 0
% 32.09/4.67 fd_pseudo 0
% 32.09/4.67 fd_cond 0
% 32.09/4.67 fd_pseudo_cond 0
% 32.09/4.67 AC symbols 2
% 32.09/4.67
% 32.09/4.67 ------ Input Options Time Limit: Unbounded
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67 ------
% 32.09/4.67 Current options:
% 32.09/4.67 ------
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67 ------ Proving...
% 32.09/4.67
% 32.09/4.67
% 32.09/4.67 % SZS status Unsatisfiable for theBenchmark.p
% 32.09/4.67
% 32.09/4.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 32.09/4.67
% 32.09/4.67
%------------------------------------------------------------------------------