TSTP Solution File: GRP170-4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP170-4 : 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:34 EDT 2024
% Result : Unsatisfiable 27.97s 4.10s
% Output : CNFRefutation 27.97s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03d_1) ).
cnf(c_50,plain,
greatest_lower_bound(c,d) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03d_2) ).
cnf(c_51,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p03d) ).
cnf(c_52,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_53,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_54,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_55,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_58,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(c_59,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_60,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_62,plain,
least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(c_82,plain,
least_upper_bound(b,a) = b,
inference(theory_normalisation,[status(thm)],[c_49,c_54,c_52,c_55,c_53]) ).
cnf(c_83,negated_conjecture,
least_upper_bound(multiply(b,d),multiply(a,c)) != multiply(b,d),
inference(theory_normalisation,[status(thm)],[c_51,c_54,c_52,c_55,c_53]) ).
cnf(c_125,plain,
multiply(b,d) = sP0_iProver_def,
definition ).
cnf(c_126,plain,
multiply(a,c) = sP1_iProver_def,
definition ).
cnf(c_127,plain,
least_upper_bound(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_128,negated_conjecture,
sP2_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_83,c_126,c_125,c_127]) ).
cnf(c_204,plain,
least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[status(thm)],[c_55,c_53]) ).
cnf(c_205,plain,
greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),
inference(superposition,[status(thm)],[c_54,c_52]) ).
cnf(c_211,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_52,c_58]) ).
cnf(c_214,plain,
greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_53,c_59]) ).
cnf(c_219,plain,
greatest_lower_bound(sP0_iProver_def,sP2_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_127,c_59]) ).
cnf(c_222,plain,
least_upper_bound(d,c) = d,
inference(superposition,[status(thm)],[c_50,c_211]) ).
cnf(c_230,plain,
least_upper_bound(c,d) = d,
inference(theory_normalisation,[status(thm)],[c_222,c_55,c_53,c_54,c_52]) ).
cnf(c_241,plain,
greatest_lower_bound(sP1_iProver_def,sP2_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_127,c_214]) ).
cnf(c_309,plain,
greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2))) = X0,
inference(superposition,[status(thm)],[c_204,c_59]) ).
cnf(c_437,plain,
least_upper_bound(sP1_iProver_def,multiply(a,X0)) = multiply(a,least_upper_bound(c,X0)),
inference(superposition,[status(thm)],[c_126,c_60]) ).
cnf(c_861,plain,
least_upper_bound(sP0_iProver_def,multiply(X0,d)) = multiply(least_upper_bound(b,X0),d),
inference(superposition,[status(thm)],[c_125,c_62]) ).
cnf(c_5415,plain,
greatest_lower_bound(sP1_iProver_def,greatest_lower_bound(X0,sP2_iProver_def)) = greatest_lower_bound(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_241,c_205]) ).
cnf(c_6046,plain,
least_upper_bound(greatest_lower_bound(X0,sP2_iProver_def),greatest_lower_bound(X0,sP1_iProver_def)) = greatest_lower_bound(X0,sP2_iProver_def),
inference(superposition,[status(thm)],[c_5415,c_211]) ).
cnf(c_6078,plain,
least_upper_bound(greatest_lower_bound(X0,sP1_iProver_def),greatest_lower_bound(X0,sP2_iProver_def)) = greatest_lower_bound(X0,sP2_iProver_def),
inference(theory_normalisation,[status(thm)],[c_6046,c_55,c_53,c_54,c_52]) ).
cnf(c_7370,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(X0,multiply(a,least_upper_bound(c,X1)))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_437,c_309]) ).
cnf(c_64324,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(X0,multiply(a,d))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_230,c_7370]) ).
cnf(c_64672,plain,
greatest_lower_bound(sP1_iProver_def,multiply(least_upper_bound(b,a),d)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_861,c_64324]) ).
cnf(c_64720,plain,
greatest_lower_bound(sP1_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_64672,c_82,c_125]) ).
cnf(c_64721,plain,
greatest_lower_bound(sP0_iProver_def,sP1_iProver_def) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_64720,c_55,c_53,c_54,c_52]) ).
cnf(c_64861,plain,
least_upper_bound(sP1_iProver_def,greatest_lower_bound(sP0_iProver_def,sP2_iProver_def)) = greatest_lower_bound(sP0_iProver_def,sP2_iProver_def),
inference(superposition,[status(thm)],[c_64721,c_6078]) ).
cnf(c_64877,plain,
least_upper_bound(sP1_iProver_def,sP0_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_64861,c_219]) ).
cnf(c_64878,plain,
least_upper_bound(sP0_iProver_def,sP1_iProver_def) = sP0_iProver_def,
inference(theory_normalisation,[status(thm)],[c_64877,c_55,c_53,c_54,c_52]) ).
cnf(c_64879,plain,
sP0_iProver_def = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_64878,c_127]) ).
cnf(c_65050,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_128,c_64879]) ).
cnf(c_65051,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_65050]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP170-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:59:39 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running UEQ theorem proving
% 0.17/0.42 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
% 27.97/4.10 % SZS status Started for theBenchmark.p
% 27.97/4.10 % SZS status Unsatisfiable for theBenchmark.p
% 27.97/4.10
% 27.97/4.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 27.97/4.10
% 27.97/4.10 ------ iProver source info
% 27.97/4.10
% 27.97/4.10 git: date: 2024-05-02 19:28:25 +0000
% 27.97/4.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 27.97/4.10 git: non_committed_changes: false
% 27.97/4.10
% 27.97/4.10 ------ Parsing...successful
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 27.97/4.10
% 27.97/4.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 27.97/4.10
% 27.97/4.10 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 27.97/4.10 ------ Proving...
% 27.97/4.10 ------ Problem Properties
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10 clauses 21
% 27.97/4.10 conjectures 1
% 27.97/4.10 EPR 1
% 27.97/4.10 Horn 21
% 27.97/4.10 unary 21
% 27.97/4.10 binary 0
% 27.97/4.10 lits 21
% 27.97/4.10 lits eq 21
% 27.97/4.10 fd_pure 0
% 27.97/4.10 fd_pseudo 0
% 27.97/4.10 fd_cond 0
% 27.97/4.10 fd_pseudo_cond 0
% 27.97/4.10 AC symbols 2
% 27.97/4.10
% 27.97/4.10 ------ Input Options Time Limit: Unbounded
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10 ------
% 27.97/4.10 Current options:
% 27.97/4.10 ------
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10 ------ Proving...
% 27.97/4.10
% 27.97/4.10
% 27.97/4.10 % SZS status Unsatisfiable for theBenchmark.p
% 27.97/4.10
% 27.97/4.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 27.97/4.10
% 27.97/4.11
%------------------------------------------------------------------------------