TSTP Solution File: GRP172-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP172-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:35 EDT 2024
% Result : Unsatisfiable 3.87s 1.15s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
greatest_lower_bound(identity,a) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04d_1) ).
cnf(c_50,plain,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04d_2) ).
cnf(c_51,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p04d) ).
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_58,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
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_60,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_64,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_65,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_66,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_123,plain,
multiply(a,b) = sP0_iProver_def,
definition ).
cnf(c_124,plain,
least_upper_bound(identity,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_125,negated_conjecture,
sP1_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_51,c_123,c_124]) ).
cnf(c_200,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,
least_upper_bound(sP0_iProver_def,identity) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_124,c_54,c_52,c_55,c_53]) ).
cnf(c_211,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(X0,identity)) = least_upper_bound(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_205,c_200]) ).
cnf(c_222,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_52,c_58]) ).
cnf(c_234,plain,
greatest_lower_bound(sP0_iProver_def,sP1_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_205,c_59]) ).
cnf(c_238,plain,
least_upper_bound(a,identity) = a,
inference(superposition,[status(thm)],[c_49,c_222]) ).
cnf(c_239,plain,
least_upper_bound(b,identity) = b,
inference(superposition,[status(thm)],[c_50,c_222]) ).
cnf(c_249,plain,
least_upper_bound(identity,b) = b,
inference(theory_normalisation,[status(thm)],[c_239,c_54,c_52,c_55,c_53]) ).
cnf(c_250,plain,
least_upper_bound(identity,a) = a,
inference(theory_normalisation,[status(thm)],[c_238,c_54,c_52,c_55,c_53]) ).
cnf(c_327,plain,
least_upper_bound(sP0_iProver_def,least_upper_bound(identity,X0)) = least_upper_bound(X0,sP1_iProver_def),
inference(superposition,[status(thm)],[c_53,c_211]) ).
cnf(c_469,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_65,c_66]) ).
cnf(c_475,plain,
multiply(a,least_upper_bound(b,X0)) = least_upper_bound(sP0_iProver_def,multiply(a,X0)),
inference(superposition,[status(thm)],[c_123,c_60]) ).
cnf(c_1133,plain,
least_upper_bound(a,sP1_iProver_def) = least_upper_bound(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_250,c_327]) ).
cnf(c_1153,plain,
least_upper_bound(sP0_iProver_def,a) = least_upper_bound(sP1_iProver_def,a),
inference(theory_normalisation,[status(thm)],[c_1133,c_54,c_52,c_55,c_53]) ).
cnf(c_1264,plain,
greatest_lower_bound(sP1_iProver_def,least_upper_bound(sP0_iProver_def,a)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_1153,c_59]) ).
cnf(c_4935,plain,
multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_469,c_64]) ).
cnf(c_4938,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[status(thm)],[c_65,c_4935]) ).
cnf(c_4941,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_4935,c_4935]) ).
cnf(c_5097,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_4938,c_4941]) ).
cnf(c_7962,plain,
multiply(a,least_upper_bound(b,identity)) = least_upper_bound(sP0_iProver_def,a),
inference(superposition,[status(thm)],[c_5097,c_475]) ).
cnf(c_7978,plain,
multiply(a,least_upper_bound(identity,b)) = least_upper_bound(sP0_iProver_def,a),
inference(theory_normalisation,[status(thm)],[c_7962,c_54,c_52,c_55,c_53]) ).
cnf(c_7979,plain,
least_upper_bound(sP0_iProver_def,a) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_7978,c_123,c_249]) ).
cnf(c_7983,plain,
greatest_lower_bound(sP1_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_1264,c_7979]) ).
cnf(c_7985,plain,
greatest_lower_bound(sP0_iProver_def,sP1_iProver_def) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_7983,c_54,c_52,c_55,c_53]) ).
cnf(c_7986,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_7985,c_234]) ).
cnf(c_8035,plain,
sP0_iProver_def != sP0_iProver_def,
inference(demodulation,[status(thm)],[c_125,c_7986]) ).
cnf(c_8036,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_8035]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP172-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 00:05:39 EDT 2024
% 0.13/0.35 % 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
% 3.87/1.15 % SZS status Started for theBenchmark.p
% 3.87/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.87/1.15
% 3.87/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.87/1.15
% 3.87/1.15 ------ iProver source info
% 3.87/1.15
% 3.87/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.87/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.87/1.15 git: non_committed_changes: false
% 3.87/1.15
% 3.87/1.15 ------ Parsing...successful
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.87/1.15
% 3.87/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.87/1.15
% 3.87/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.87/1.15 ------ Proving...
% 3.87/1.15 ------ Problem Properties
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15 clauses 20
% 3.87/1.15 conjectures 1
% 3.87/1.15 EPR 1
% 3.87/1.15 Horn 20
% 3.87/1.15 unary 20
% 3.87/1.15 binary 0
% 3.87/1.15 lits 20
% 3.87/1.15 lits eq 20
% 3.87/1.15 fd_pure 0
% 3.87/1.15 fd_pseudo 0
% 3.87/1.15 fd_cond 0
% 3.87/1.15 fd_pseudo_cond 0
% 3.87/1.15 AC symbols 2
% 3.87/1.15
% 3.87/1.15 ------ Input Options Time Limit: Unbounded
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15 ------
% 3.87/1.15 Current options:
% 3.87/1.15 ------
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15 ------ Proving...
% 3.87/1.15
% 3.87/1.15
% 3.87/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.87/1.15
% 3.87/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.87/1.15
% 3.87/1.15
%------------------------------------------------------------------------------