TSTP Solution File: GRP147-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP147-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:29 EDT 2024
% Result : Unsatisfiable 0.44s 1.12s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1b_1) ).
cnf(c_50,plain,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1b_2) ).
cnf(c_51,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub1b) ).
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_82,negated_conjecture,
greatest_lower_bound(c,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(theory_normalisation,[status(thm)],[c_51,c_55,c_53,c_54,c_52]) ).
cnf(c_124,plain,
least_upper_bound(a,b) = sP0_iProver_def,
definition ).
cnf(c_125,plain,
greatest_lower_bound(c,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_126,negated_conjecture,
sP1_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_82,c_124,c_125]) ).
cnf(c_200,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_201,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_206,plain,
greatest_lower_bound(sP0_iProver_def,c) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_125,c_54,c_52,c_55,c_53]) ).
cnf(c_213,plain,
greatest_lower_bound(a,greatest_lower_bound(X0,c)) = greatest_lower_bound(X0,a),
inference(superposition,[status(thm)],[c_49,c_200]) ).
cnf(c_214,plain,
greatest_lower_bound(b,greatest_lower_bound(X0,c)) = greatest_lower_bound(X0,b),
inference(superposition,[status(thm)],[c_50,c_200]) ).
cnf(c_234,plain,
least_upper_bound(sP0_iProver_def,sP1_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_206,c_58]) ).
cnf(c_236,plain,
greatest_lower_bound(a,sP0_iProver_def) = a,
inference(superposition,[status(thm)],[c_124,c_59]) ).
cnf(c_237,plain,
greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_53,c_59]) ).
cnf(c_245,plain,
greatest_lower_bound(sP0_iProver_def,a) = a,
inference(theory_normalisation,[status(thm)],[c_236,c_54,c_52,c_55,c_53]) ).
cnf(c_278,plain,
greatest_lower_bound(b,sP0_iProver_def) = b,
inference(superposition,[status(thm)],[c_124,c_237]) ).
cnf(c_295,plain,
greatest_lower_bound(sP0_iProver_def,b) = b,
inference(theory_normalisation,[status(thm)],[c_278,c_54,c_52,c_55,c_53]) ).
cnf(c_326,plain,
least_upper_bound(a,least_upper_bound(X0,b)) = least_upper_bound(X0,sP0_iProver_def),
inference(superposition,[status(thm)],[c_124,c_201]) ).
cnf(c_546,plain,
greatest_lower_bound(a,sP1_iProver_def) = greatest_lower_bound(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_206,c_213]) ).
cnf(c_555,plain,
greatest_lower_bound(sP0_iProver_def,a) = greatest_lower_bound(sP1_iProver_def,a),
inference(theory_normalisation,[status(thm)],[c_546,c_54,c_52,c_55,c_53]) ).
cnf(c_556,plain,
greatest_lower_bound(sP1_iProver_def,a) = a,
inference(light_normalisation,[status(thm)],[c_555,c_245]) ).
cnf(c_596,plain,
least_upper_bound(sP1_iProver_def,a) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_556,c_58]) ).
cnf(c_616,plain,
greatest_lower_bound(b,sP1_iProver_def) = greatest_lower_bound(sP0_iProver_def,b),
inference(superposition,[status(thm)],[c_206,c_214]) ).
cnf(c_625,plain,
greatest_lower_bound(sP0_iProver_def,b) = greatest_lower_bound(sP1_iProver_def,b),
inference(theory_normalisation,[status(thm)],[c_616,c_54,c_52,c_55,c_53]) ).
cnf(c_626,plain,
greatest_lower_bound(sP1_iProver_def,b) = b,
inference(light_normalisation,[status(thm)],[c_625,c_295]) ).
cnf(c_638,plain,
least_upper_bound(sP1_iProver_def,b) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_626,c_58]) ).
cnf(c_1365,plain,
least_upper_bound(a,sP1_iProver_def) = least_upper_bound(sP1_iProver_def,sP0_iProver_def),
inference(superposition,[status(thm)],[c_638,c_326]) ).
cnf(c_1374,plain,
least_upper_bound(sP0_iProver_def,sP1_iProver_def) = least_upper_bound(sP1_iProver_def,a),
inference(theory_normalisation,[status(thm)],[c_1365,c_54,c_52,c_55,c_53]) ).
cnf(c_1375,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_1374,c_234,c_596]) ).
cnf(c_1403,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_126,c_1375]) ).
cnf(c_1404,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1403]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP147-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.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 : Fri May 3 00:06:42 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 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
% 0.44/1.12 % SZS status Started for theBenchmark.p
% 0.44/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.12
% 0.44/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.12
% 0.44/1.12 ------ iProver source info
% 0.44/1.12
% 0.44/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.44/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.44/1.12 git: non_committed_changes: false
% 0.44/1.12
% 0.44/1.12 ------ Parsing...successful
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.44/1.12
% 0.44/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.12
% 0.44/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.44/1.12 ------ Proving...
% 0.44/1.12 ------ Problem Properties
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 clauses 20
% 0.44/1.12 conjectures 1
% 0.44/1.12 EPR 1
% 0.44/1.12 Horn 20
% 0.44/1.12 unary 20
% 0.44/1.12 binary 0
% 0.44/1.12 lits 20
% 0.44/1.12 lits eq 20
% 0.44/1.12 fd_pure 0
% 0.44/1.12 fd_pseudo 0
% 0.44/1.12 fd_cond 0
% 0.44/1.12 fd_pseudo_cond 0
% 0.44/1.12 AC symbols 2
% 0.44/1.12
% 0.44/1.12 ------ Input Options Time Limit: Unbounded
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 ------
% 0.44/1.12 Current options:
% 0.44/1.12 ------
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 ------ Proving...
% 0.44/1.12
% 0.44/1.12
% 0.44/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 0.44/1.12
% 0.44/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.13
% 0.44/1.13
%------------------------------------------------------------------------------