TSTP Solution File: HEN009-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HEN009-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n007.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 : 600s
% DateTime : Sat Jul 16 13:02:30 EDT 2022
% Result : Unsatisfiable 0.37s 0.61s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 54 ( 51 unt; 0 nHn; 25 RR)
% Number of literals : 58 ( 24 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( ~ less_equal(X,Y)
| divide(X,Y) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(quotient_less_equal2,axiom,
( divide(X,Y) != zero
| less_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X,Y),X),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| X = Y ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(identity_is_largest,axiom,
less_equal(X,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(id_divide_a_is_b,hypothesis,
divide(identity,a) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id_divide_a_is_b) ).
cnf(id_divide_b_is_c,hypothesis,
divide(identity,b) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id_divide_b_is_c) ).
cnf(id_divide_c_is_d,hypothesis,
divide(identity,c) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id_divide_c_is_d) ).
cnf(prove_b_equals_d,negated_conjecture,
b != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_equals_d) ).
cnf(13,plain,
divide(X,identity) = zero,
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal1,identity_is_largest]) ).
cnf(14,plain,
divide(zero,X) = zero,
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal1,zero_is_smallest]) ).
cnf(15,plain,
divide(divide(X,Y),X) = zero,
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal1,quotient_smaller_than_numerator]) ).
cnf(19,plain,
less_equal(divide(d,divide(X,c)),divide(divide(identity,X),c)),
inference('PARAMODULATE',[status(thm)],[quotient_property,id_divide_c_is_d,theory(equality)]) ).
cnf(20,plain,
less_equal(divide(c,divide(X,b)),divide(divide(identity,X),b)),
inference('PARAMODULATE',[status(thm)],[quotient_property,id_divide_b_is_c,theory(equality)]) ).
cnf(21,plain,
less_equal(divide(b,divide(X,a)),divide(divide(identity,X),a)),
inference('PARAMODULATE',[status(thm)],[quotient_property,id_divide_a_is_b,theory(equality)]) ).
cnf(22,plain,
less_equal(divide(divide(X,c),d),zero),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quotient_property,id_divide_c_is_d,theory(equality)]),14,13,theory(equality)]) ).
cnf(23,plain,
less_equal(divide(divide(X,b),c),zero),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quotient_property,id_divide_b_is_c,theory(equality)]),14,13,theory(equality)]) ).
cnf(24,plain,
less_equal(divide(divide(X,a),b),zero),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quotient_property,id_divide_a_is_b,theory(equality)]),14,13,theory(equality)]) ).
cnf(29,plain,
less_equal(divide(divide(X,Y),divide(identity,Y)),zero),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quotient_property,13,theory(equality)]),14,theory(equality)]) ).
cnf(33,plain,
less_equal(divide(divide(divide(X,Y),Z),divide(X,Z)),zero),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quotient_property,15,theory(equality)]),14,theory(equality)]) ).
cnf(35,plain,
divide(divide(X,c),d) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,22,zero_is_smallest]) ).
cnf(41,plain,
divide(divide(X,b),c) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,23,zero_is_smallest]) ).
cnf(47,plain,
divide(divide(X,a),b) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,24,zero_is_smallest]) ).
cnf(52,plain,
less_equal(divide(X,c),d),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,35]) ).
cnf(53,plain,
less_equal(divide(divide(X,d),divide(c,d)),zero),
inference('PARAMODULATE',[status(thm)],[quotient_property,35,theory(equality)]) ).
cnf(56,plain,
less_equal(divide(X,b),c),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,41]) ).
cnf(60,plain,
less_equal(divide(X,a),b),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,47]) ).
cnf(64,plain,
divide(divide(X,Y),divide(identity,Y)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,29,zero_is_smallest]) ).
cnf(75,plain,
less_equal(divide(d,divide(b,c)),zero),
inference('PARAMODULATE',[status(thm)],[19,41,theory(equality)]) ).
cnf(83,plain,
divide(d,divide(b,c)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,75,zero_is_smallest]) ).
cnf(86,plain,
less_equal(d,divide(b,c)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,83]) ).
cnf(89,plain,
d = divide(b,c),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,86,52]) ).
cnf(90,plain,
less_equal(d,b),
inference('PARAMODULATE',[status(thm)],[quotient_smaller_than_numerator,89,theory(equality)]) ).
cnf(95,plain,
~ less_equal(b,d),
inference('UR-RESOLVE',[status(thm)],[less_equal_and_equal,90,prove_b_equals_d]) ).
cnf(99,plain,
less_equal(divide(c,divide(a,b)),zero),
inference('PARAMODULATE',[status(thm)],[20,47,theory(equality)]) ).
cnf(109,plain,
divide(c,divide(a,b)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,99,zero_is_smallest]) ).
cnf(117,plain,
less_equal(c,divide(a,b)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,109]) ).
cnf(120,plain,
c = divide(a,b),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,117,56]) ).
cnf(147,plain,
divide(divide(X,d),divide(c,d)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,53,zero_is_smallest]) ).
cnf(148,plain,
less_equal(divide(X,Y),divide(identity,Y)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,64]) ).
cnf(166,plain,
less_equal(divide(X,d),divide(c,d)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,147]) ).
cnf(170,plain,
divide(identity,d) = divide(c,d),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,166,148]) ).
cnf(175,plain,
less_equal(divide(b,divide(d,a)),divide(divide(c,d),a)),
inference('PARAMODULATE',[status(thm)],[21,170,theory(equality)]) ).
cnf(179,plain,
divide(divide(divide(X,Y),Z),divide(X,Z)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,33,zero_is_smallest]) ).
cnf(204,plain,
less_equal(divide(divide(X,Y),Z),divide(X,Z)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,179]) ).
cnf(226,plain,
less_equal(divide(c,X),divide(a,X)),
inference('PARAMODULATE',[status(thm)],[204,120,theory(equality)]) ).
cnf(241,plain,
divide(c,d) = divide(a,d),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,226,166]) ).
cnf(251,plain,
less_equal(divide(b,divide(d,a)),zero),
inference('REWRITE',[status(thm)],[175,15,241,theory(equality)]) ).
cnf(265,plain,
divide(b,divide(d,a)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,251,zero_is_smallest]) ).
cnf(299,plain,
less_equal(b,divide(d,a)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,265]) ).
cnf(307,plain,
b = divide(d,a),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,299,60]) ).
cnf(308,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quotient_smaller_than_numerator,307,theory(equality)]),95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN009-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n007.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 13:18:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T13:18:24
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-07-01T13:18:24
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 #||
% 0.37/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.61 % SZS output start Refutation
% See solution above
% 0.37/0.61 ||#
% 0.37/0.61
% 0.37/0.61 ; Summary of computation:
% 0.37/0.61 ; 1844 formulas have been input or derived (from 140 formulas).
% 0.37/0.61 ; 308 (17%) were retained. Of these,
% 0.37/0.61 ; 161 (52%) were simplified or subsumed later,
% 0.37/0.61 ; 147 (48%) are still being kept.
% 0.37/0.61 ;
% 0.37/0.62 ; Run time in seconds excluding printing time:
% 0.37/0.62 ; 0.002 1% Read assertion file (1 call)
% 0.37/0.62 ; 0.001 1% Assert (12 calls)
% 0.37/0.62 ; 0.033 24% Process new row (1,422 calls)
% 0.37/0.62 ; 0.014 10% Resolution (278 calls)
% 0.37/0.62 ; 0.024 18% Paramodulation (139 calls)
% 0.37/0.62 ; 0.000 0% Condensing (16 calls)
% 0.37/0.62 ; 0.000 0% Forward subsumption (16 calls)
% 0.37/0.62 ; 0.000 0% Backward subsumption (15 calls)
% 0.37/0.62 ; 0.000 0% Clause clause subsumption (4 calls)
% 0.37/0.62 ; 0.020 15% Forward simplification (1,321 calls)
% 0.37/0.62 ; 0.010 7% Backward simplification (308 calls)
% 0.37/0.62 ; 0.001 1% Ordering (1,297 calls)
% 0.37/0.62 ; 0.001 1% Sortal reasoning (32 calls)
% 0.37/0.62 ; 0.000 0% Purity testing (1 call)
% 0.37/0.62 ; 0.030 22% Other
% 0.37/0.62 ; 0.136 Total
% 0.37/0.62 ; 0.140 Real time
% 0.37/0.62 ;
% 0.37/0.62 ; Term-hash-array has 666 terms in all.
% 0.37/0.62 ; Feature-vector-row-index has 14 entries (14 at peak, 15 added, 1 deleted).
% 0.37/0.62 ; Feature-vector-row-index has 58 nodes (58 at peak, 66 added, 8 deleted).
% 0.37/0.62 ; Retrieved 5 possibly forward subsuming rows in 16 calls.
% 0.37/0.62 ; Retrieved 0 possibly backward subsumed rows in 15 calls.
% 0.37/0.62 ; Path-index has 348 entries (453 at peak, 682 added, 334 deleted).
% 0.37/0.62 ; Path-index has 411 nodes (485 at peak, 613 added, 202 deleted).
% 0.37/0.62 ; Trie-index has 348 entries (453 at peak, 682 added, 334 deleted).
% 0.37/0.62 ; Trie-index has 1,123 nodes (1,613 at peak, 2,386 added, 1,263 deleted).
% 0.37/0.62 ; Retrieved 4,879 generalization terms in 4,137 calls.
% 0.37/0.62 ; Retrieved 542 instance terms in 292 calls.
% 0.37/0.62 ; Retrieved 4,154 unifiable terms in 1,721 calls.
% 0.37/0.62 ;
% 0.37/0.62 ; The agenda of rows to process has 18 entries:
% 0.37/0.62 ; 1 with value 15 1 with value 20 1 with value 24
% 0.37/0.62 ; 4 with value 18 2 with value 21 3 with value 25
% 0.37/0.62 ; 1 with value 19 5 with value 23
% 0.37/0.62 ; The agenda of rows to give has 79 entries:
% 0.37/0.62 ; 1 with value (4 18) 10 with value (4 22) 5 with value (4 25)
% 0.37/0.62 ; 25 with value (4 19) 7 with value (4 23) 1 with value (4 26)
% 0.37/0.62 ; 12 with value (4 20) 5 with value (4 24) 1 with value (4 28)
% 0.37/0.62 ; 12 with value (4 21)
% 0.37/0.62 Evaluation took:
% 0.37/0.62 0.14 seconds of real time
% 0.37/0.62 0.119995 seconds of user run time
% 0.37/0.62 0.020105 seconds of system run time
% 0.37/0.62 0 calls to %EVAL
% 0.37/0.62 0 page faults and
% 0.37/0.62 9,983,216 bytes consed.
% 0.37/0.62 :PROOF-FOUND
% 0.37/0.62 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T13:18:24
% 0.37/0.62 :PROOF-FOUND
% 0.37/0.62 *
%------------------------------------------------------------------------------