TSTP Solution File: GRP191-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP191-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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 : Thu Aug 31 00:17:40 EDT 2023
% Result : Unsatisfiable 0.18s 0.66s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 57 ( 50 unt; 7 typ; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 78 ( 9 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
identity: $i ).
tff(decl_23,type,
multiply: ( $i * $i ) > $i ).
tff(decl_24,type,
inverse: $i > $i ).
tff(decl_25,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(decl_26,type,
least_upper_bound: ( $i * $i ) > $i ).
tff(decl_27,type,
a: $i ).
tff(decl_28,type,
b: $i ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(p39d_1,hypothesis,
greatest_lower_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p39d_1) ).
cnf(prove_p39d,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p39d) ).
cnf(c_0_11,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_12,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_13,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_14,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_17,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_19,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_20,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_21,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_23,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_20]) ).
cnf(c_0_24,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_25,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(X2,identity),X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_27,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_28,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_17]) ).
cnf(c_0_29,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_30,plain,
least_upper_bound(identity,inverse(greatest_lower_bound(X1,identity))) = inverse(greatest_lower_bound(X1,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_26]) ).
cnf(c_0_31,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_20]) ).
cnf(c_0_32,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_33,plain,
multiply(greatest_lower_bound(X1,identity),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_20]) ).
cnf(c_0_34,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(X1,identity))) = identity,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
greatest_lower_bound(inverse(X1),inverse(multiply(X2,X1))) = multiply(inverse(X1),greatest_lower_bound(identity,inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20]) ).
cnf(c_0_36,plain,
multiply(greatest_lower_bound(identity,X1),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_37,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X1))) = identity,
inference(spm,[status(thm)],[c_0_34,c_0_20]) ).
cnf(c_0_38,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_28]),c_0_18]) ).
cnf(c_0_39,plain,
multiply(inverse(X1),greatest_lower_bound(multiply(X1,X2),X3)) = greatest_lower_bound(X2,multiply(inverse(X1),X3)),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_40,plain,
greatest_lower_bound(X1,inverse(greatest_lower_bound(identity,inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_18]),c_0_18]),c_0_37]),c_0_17]) ).
cnf(c_0_41,plain,
multiply(greatest_lower_bound(X1,inverse(multiply(X2,X3))),X2) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_42,plain,
greatest_lower_bound(X1,inverse(greatest_lower_bound(X2,inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_14]),c_0_32]),c_0_41]),c_0_13]) ).
cnf(c_0_43,hypothesis,
greatest_lower_bound(a,b) = b,
p39d_1 ).
cnf(c_0_44,plain,
greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_45,hypothesis,
greatest_lower_bound(b,a) = b,
inference(rw,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_46,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
prove_p39d ).
cnf(c_0_47,hypothesis,
greatest_lower_bound(inverse(b),inverse(a)) = inverse(a),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_20]) ).
cnf(c_0_48,negated_conjecture,
least_upper_bound(inverse(b),inverse(a)) != inverse(b),
inference(rw,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP191-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 23:49:47 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.55 start to proof: theBenchmark
% 0.18/0.66 % Version : CSE_E---1.5
% 0.18/0.66 % Problem : theBenchmark.p
% 0.18/0.66 % Proof found
% 0.18/0.66 % SZS status Theorem for theBenchmark.p
% 0.18/0.66 % SZS output start Proof
% See solution above
% 0.18/0.67 % Total time : 0.099000 s
% 0.18/0.67 % SZS output end Proof
% 0.18/0.67 % Total time : 0.102000 s
%------------------------------------------------------------------------------