TSTP Solution File: HEN001-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : HEN001-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n017.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 01:54:13 EDT 2023
% Result : Unsatisfiable 0.22s 0.60s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 13 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 10 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 3 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
less_equal: ( $i * $i ) > $o ).
tff(decl_23,type,
divide: ( $i * $i ) > $i ).
tff(decl_24,type,
zero: $i ).
tff(decl_25,type,
identity: $i ).
tff(decl_26,type,
a: $i ).
cnf(quotient_less_equal1,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(prove_a_divide_id_is_zero,negated_conjecture,
divide(a,identity) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_divide_id_is_zero) ).
cnf(c_0_3,axiom,
( divide(X1,X2) = zero
| ~ less_equal(X1,X2) ),
quotient_less_equal1 ).
cnf(c_0_4,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_5,negated_conjecture,
divide(a,identity) != zero,
prove_a_divide_id_is_zero ).
cnf(c_0_6,plain,
divide(X1,identity) = zero,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HEN001-3 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 12:57:09 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.59 start to proof: theBenchmark
% 0.22/0.60 % Version : CSE_E---1.5
% 0.22/0.60 % Problem : theBenchmark.p
% 0.22/0.60 % Proof found
% 0.22/0.60 % SZS status Theorem for theBenchmark.p
% 0.22/0.60 % SZS output start Proof
% See solution above
% 0.22/0.60 % Total time : 0.003000 s
% 0.22/0.60 % SZS output end Proof
% 0.22/0.60 % Total time : 0.006000 s
%------------------------------------------------------------------------------