TSTP Solution File: GRP148-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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 3.66s 1.16s
% Output : CNFRefutation 3.66s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
least_upper_bound(a,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1c_1) ).
cnf(c_50,plain,
least_upper_bound(b,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1c_2) ).
cnf(c_51,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1c) ).
cnf(c_52,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_53,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_54,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_55,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,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_82,plain,
least_upper_bound(c,a) = c,
inference(theory_normalisation,[status(thm)],[c_49,c_54,c_52,c_55,c_53]) ).
cnf(c_83,plain,
least_upper_bound(c,b) = c,
inference(theory_normalisation,[status(thm)],[c_50,c_54,c_52,c_55,c_53]) ).
cnf(c_84,negated_conjecture,
greatest_lower_bound(c,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(theory_normalisation,[status(thm)],[c_51,c_54,c_52,c_55,c_53]) ).
cnf(c_126,plain,
least_upper_bound(a,b) = sP0_iProver_def,
definition ).
cnf(c_127,plain,
greatest_lower_bound(c,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_128,negated_conjecture,
sP1_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_84,c_126,c_127]) ).
cnf(c_202,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_208,plain,
greatest_lower_bound(sP0_iProver_def,c) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_127,c_55,c_53,c_54,c_52]) ).
cnf(c_215,plain,
least_upper_bound(a,least_upper_bound(X0,b)) = least_upper_bound(X0,sP0_iProver_def),
inference(superposition,[status(thm)],[c_126,c_202]) ).
cnf(c_547,plain,
least_upper_bound(a,c) = least_upper_bound(c,sP0_iProver_def),
inference(superposition,[status(thm)],[c_83,c_215]) ).
cnf(c_558,plain,
least_upper_bound(c,a) = least_upper_bound(sP0_iProver_def,c),
inference(theory_normalisation,[status(thm)],[c_547,c_55,c_53,c_54,c_52]) ).
cnf(c_559,plain,
least_upper_bound(sP0_iProver_def,c) = c,
inference(light_normalisation,[status(thm)],[c_558,c_82]) ).
cnf(c_603,plain,
greatest_lower_bound(sP0_iProver_def,c) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_559,c_59]) ).
cnf(c_607,plain,
sP0_iProver_def = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_208,c_603]) ).
cnf(c_612,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_128,c_607]) ).
cnf(c_613,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_612]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:38:11 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running UEQ theorem proving
% 0.20/0.48 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
% 3.66/1.16 % SZS status Started for theBenchmark.p
% 3.66/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.66/1.16
% 3.66/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.66/1.16
% 3.66/1.16 ------ iProver source info
% 3.66/1.16
% 3.66/1.16 git: date: 2024-05-02 19:28:25 +0000
% 3.66/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.66/1.16 git: non_committed_changes: false
% 3.66/1.16
% 3.66/1.16 ------ Parsing...successful
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.66/1.16
% 3.66/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.66/1.16
% 3.66/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.66/1.16 ------ Proving...
% 3.66/1.16 ------ Problem Properties
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16 clauses 20
% 3.66/1.16 conjectures 1
% 3.66/1.16 EPR 1
% 3.66/1.16 Horn 20
% 3.66/1.16 unary 20
% 3.66/1.16 binary 0
% 3.66/1.16 lits 20
% 3.66/1.16 lits eq 20
% 3.66/1.16 fd_pure 0
% 3.66/1.16 fd_pseudo 0
% 3.66/1.16 fd_cond 0
% 3.66/1.16 fd_pseudo_cond 0
% 3.66/1.16 AC symbols 2
% 3.66/1.16
% 3.66/1.16 ------ Input Options Time Limit: Unbounded
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16 ------
% 3.66/1.16 Current options:
% 3.66/1.16 ------
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16 ------ Proving...
% 3.66/1.16
% 3.66/1.16
% 3.66/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.66/1.16
% 3.66/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.66/1.16
% 3.66/1.16
%------------------------------------------------------------------------------