TSTP Solution File: GRP193-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP193-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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:41 EDT 2023
% Result : Unsatisfiable 2.08s 2.16s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 21
% Syntax : Number of formulae : 46 ( 38 unt; 8 typ; 0 def)
% Number of atoms : 38 ( 37 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 4 ( 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 6 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 ).
tff(decl_29,type,
c: $i ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(p8_9b_3,hypothesis,
greatest_lower_bound(identity,c) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_3) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p8_9b_4,hypothesis,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_4) ).
cnf(prove_p8_9b,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p8_9b) ).
cnf(c_0_13,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_14,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_15,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_16,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_19,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_20,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_22,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_23,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_24,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
greatest_lower_bound(identity,c) = identity,
p8_9b_3 ).
cnf(c_0_27,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_28,plain,
greatest_lower_bound(X1,multiply(X1,least_upper_bound(identity,X2))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
least_upper_bound(identity,c) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_31,hypothesis,
greatest_lower_bound(X1,multiply(X1,c)) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,hypothesis,
greatest_lower_bound(X1,greatest_lower_bound(multiply(X1,c),X2)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_34,hypothesis,
greatest_lower_bound(X1,multiply(greatest_lower_bound(X1,X2),c)) = greatest_lower_bound(X1,multiply(X2,c)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,hypothesis,
greatest_lower_bound(a,b) = identity,
p8_9b_4 ).
cnf(c_0_36,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
prove_p8_9b ).
cnf(c_0_37,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP193-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n029.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 : Tue Aug 29 01:56:11 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.53/0.57 start to proof: theBenchmark
% 2.08/2.16 % Version : CSE_E---1.5
% 2.08/2.16 % Problem : theBenchmark.p
% 2.08/2.16 % Proof found
% 2.08/2.16 % SZS status Theorem for theBenchmark.p
% 2.08/2.16 % SZS output start Proof
% See solution above
% 2.08/2.17 % Total time : 1.583000 s
% 2.08/2.17 % SZS output end Proof
% 2.08/2.17 % Total time : 1.587000 s
%------------------------------------------------------------------------------