TSTP Solution File: GRP190-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:41 EDT 2024
% Result : Unsatisfiable 8.12s 1.71s
% Output : CNFRefutation 8.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% 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_121,plain,
inverse(a) = sP0_iProver_def,
definition ).
cnf(c_122,plain,
inverse(b) = sP1_iProver_def,
definition ).
cnf(c_123,plain,
least_upper_bound(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_124,negated_conjecture,
sP2_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_50,c_122,c_121,c_123]) ).
cnf(c_227,plain,
multiply(sP0_iProver_def,a) = identity,
inference(superposition,[status(thm)],[c_121,c_64]) ).
cnf(c_228,plain,
multiply(sP1_iProver_def,b) = identity,
inference(superposition,[status(thm)],[c_122,c_64]) ).
cnf(c_463,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_64,c_65]) ).
cnf(c_481,plain,
least_upper_bound(identity,multiply(sP0_iProver_def,X0)) = multiply(sP0_iProver_def,least_upper_bound(a,X0)),
inference(superposition,[status(thm)],[c_227,c_59]) ).
cnf(c_844,plain,
least_upper_bound(identity,multiply(X0,b)) = multiply(least_upper_bound(sP1_iProver_def,X0),b),
inference(superposition,[status(thm)],[c_228,c_61]) ).
cnf(c_3724,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_463,c_63]) ).
cnf(c_3728,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_64,c_3724]) ).
cnf(c_3735,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_3724,c_3724]) ).
cnf(c_3933,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_3728,c_3735]) ).
cnf(c_4900,plain,
inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_3735,c_3933]) ).
cnf(c_4901,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_4900,c_3933]) ).
cnf(c_11055,plain,
multiply(least_upper_bound(sP1_iProver_def,sP0_iProver_def),b) = multiply(sP0_iProver_def,least_upper_bound(a,b)),
inference(superposition,[status(thm)],[c_844,c_481]) ).
cnf(c_11065,plain,
multiply(least_upper_bound(sP0_iProver_def,sP1_iProver_def),b) = multiply(sP0_iProver_def,least_upper_bound(a,b)),
inference(theory_normalisation,[status(thm)],[c_11055,c_54,c_52,c_53,c_51]) ).
cnf(c_11066,plain,
multiply(sP2_iProver_def,b) = identity,
inference(light_normalisation,[status(thm)],[c_11065,c_49,c_123,c_227]) ).
cnf(c_11310,plain,
multiply(inverse(sP2_iProver_def),identity) = b,
inference(superposition,[status(thm)],[c_11066,c_3724]) ).
cnf(c_11388,plain,
inverse(sP2_iProver_def) = b,
inference(demodulation,[status(thm)],[c_11310,c_3933]) ).
cnf(c_11392,plain,
inverse(b) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_11388,c_4901]) ).
cnf(c_11395,plain,
sP1_iProver_def = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_11392,c_122]) ).
cnf(c_11444,plain,
sP1_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_124,c_11395]) ).
cnf(c_11445,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_11444]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 23:40:04 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running UEQ theorem proving
% 0.20/0.47 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
% 8.12/1.71 % SZS status Started for theBenchmark.p
% 8.12/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 8.12/1.71
% 8.12/1.71 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.12/1.71
% 8.12/1.71 ------ iProver source info
% 8.12/1.71
% 8.12/1.71 git: date: 2024-05-02 19:28:25 +0000
% 8.12/1.71 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.12/1.71 git: non_committed_changes: false
% 8.12/1.71
% 8.12/1.71 ------ Parsing...successful
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 8.12/1.71
% 8.12/1.71 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.12/1.71
% 8.12/1.71 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 8.12/1.71 ------ Proving...
% 8.12/1.71 ------ Problem Properties
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71 clauses 20
% 8.12/1.71 conjectures 1
% 8.12/1.71 EPR 1
% 8.12/1.71 Horn 20
% 8.12/1.71 unary 20
% 8.12/1.71 binary 0
% 8.12/1.71 lits 20
% 8.12/1.71 lits eq 20
% 8.12/1.71 fd_pure 0
% 8.12/1.71 fd_pseudo 0
% 8.12/1.71 fd_cond 0
% 8.12/1.71 fd_pseudo_cond 0
% 8.12/1.71 AC symbols 2
% 8.12/1.71
% 8.12/1.71 ------ Input Options Time Limit: Unbounded
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71 ------
% 8.12/1.71 Current options:
% 8.12/1.71 ------
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71 ------ Proving...
% 8.12/1.71
% 8.12/1.71
% 8.12/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 8.12/1.71
% 8.12/1.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.12/1.71
% 8.12/1.71
%------------------------------------------------------------------------------