TSTP Solution File: GRP192-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP192-1 : 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 : n016.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.20s 0.60s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 28 unt; 7 typ; 0 def)
% Number of atoms : 28 ( 27 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 8 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(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(p40a_1,hypothesis,
least_upper_bound(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p40a_1) ).
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(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(prove_p40a,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p40a) ).
cnf(c_0_8,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_9,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_10,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_11,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_13,hypothesis,
least_upper_bound(identity,X1) = X1,
p40a_1 ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_16,hypothesis,
greatest_lower_bound(identity,X1) = identity,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_18,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_20,hypothesis,
greatest_lower_bound(X1,identity) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),c_0_18]),c_0_17]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_24,plain,
greatest_lower_bound(X1,X2) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_p40a ).
cnf(c_0_26,plain,
X1 = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_24]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP192-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n016.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 : Tue Aug 29 01:37:00 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.55/0.60 % Total time : 0.007000 s
% 0.55/0.60 % SZS output end Proof
% 0.55/0.60 % Total time : 0.009000 s
%------------------------------------------------------------------------------