TSTP Solution File: HEN010-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HEN010-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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:32 EDT 2022
% Result : Unsatisfiable 0.44s 0.61s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of clauses : 41 ( 38 unt; 0 nHn; 6 RR)
% Number of literals : 45 ( 19 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% 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 : 70 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( ~ less_equal(X,Y)
| divide(X,Y) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(quotient_less_equal2,axiom,
( divide(X,Y) != zero
| less_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X,Y),X),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(identity_is_largest,axiom,
less_equal(X,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(prove_property_of_inversion,negated_conjecture,
divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_of_inversion) ).
cnf(9,plain,
divide(X,identity) = zero,
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal1,identity_is_largest]) ).
cnf(10,plain,
divide(zero,X) = zero,
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal1,zero_is_smallest]) ).
cnf(11,plain,
divide(divide(X,Y),X) = zero,
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal1,quotient_smaller_than_numerator]) ).
cnf(12,plain,
divide(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)) = zero,
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal1,quotient_property]) ).
cnf(13,plain,
~ less_equal(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))),
inference('UR-RESOLVE',[status(thm)],[less_equal_and_equal,prove_property_of_inversion,quotient_smaller_than_numerator]) ).
cnf(14,plain,
less_equal(divide(divide(X,Y),divide(identity,Y)),zero),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quotient_property,9,theory(equality)]),10,theory(equality)]) ).
cnf(15,plain,
less_equal(divide(divide(X,Y),zero),divide(divide(X,zero),Y)),
inference('PARAMODULATE',[status(thm)],[quotient_property,10,theory(equality)]) ).
cnf(16,plain,
less_equal(divide(divide(X,X),divide(Y,X)),zero),
inference('PARAMODULATE',[status(thm)],[quotient_property,11,theory(equality)]) ).
cnf(17,plain,
less_equal(divide(divide(X,Y),zero),divide(divide(X,divide(Y,Z)),Y)),
inference('PARAMODULATE',[status(thm)],[quotient_property,11,theory(equality)]) ).
cnf(19,plain,
divide(divide(X,Y),divide(identity,Y)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,14,zero_is_smallest]) ).
cnf(20,plain,
less_equal(divide(divide(X,X),zero),zero),
inference('PARAMODULATE',[status(thm)],[16,10,theory(equality)]) ).
cnf(22,plain,
divide(divide(X,X),zero) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,20,zero_is_smallest]) ).
cnf(23,plain,
less_equal(divide(X,X),zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,22]) ).
cnf(26,plain,
divide(X,X) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,23,zero_is_smallest]) ).
cnf(30,plain,
less_equal(divide(X,Y),divide(identity,Y)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,19]) ).
cnf(31,plain,
less_equal(divide(divide(X,divide(identity,Y)),divide(Y,divide(identity,Y))),zero),
inference('PARAMODULATE',[status(thm)],[quotient_property,19,theory(equality)]) ).
cnf(36,plain,
less_equal(divide(divide(X,divide(X,zero)),zero),zero),
inference('PARAMODULATE',[status(thm)],[15,26,theory(equality)]) ).
cnf(74,plain,
less_equal(divide(divide(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)),zero),zero),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,12,theory(equality)]),10,theory(equality)]) ).
cnf(99,plain,
divide(divide(X,divide(X,zero)),zero) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,36,zero_is_smallest]) ).
cnf(119,plain,
divide(divide(X,divide(identity,Y)),divide(Y,divide(identity,Y))) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,31,zero_is_smallest]) ).
cnf(121,plain,
less_equal(divide(X,divide(X,zero)),zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,99]) ).
cnf(126,plain,
divide(X,divide(X,zero)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,121,zero_is_smallest]) ).
cnf(127,plain,
less_equal(X,divide(X,zero)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,126]) ).
cnf(136,plain,
X = divide(X,zero),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,127,quotient_smaller_than_numerator]) ).
cnf(151,plain,
less_equal(divide(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)),zero),
inference('REWRITE',[status(thm)],[74,136,theory(equality)]) ).
cnf(163,plain,
divide(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,151,zero_is_smallest]) ).
cnf(176,plain,
less_equal(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,163]) ).
cnf(177,plain,
divide(divide(X,Y),divide(X,divide(Y,Z))) = zero,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[163,11,theory(equality)]),136,theory(equality)]) ).
cnf(217,plain,
less_equal(divide(X,divide(identity,Y)),divide(Y,divide(identity,Y))),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal2,119]) ).
cnf(219,plain,
divide(divide(X,divide(identity,Y)),Y) = zero,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[177,119,theory(equality)]),136,theory(equality)]) ).
cnf(233,plain,
less_equal(divide(X,Y),divide(X,divide(Z,divide(identity,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[176,219,theory(equality)]),136,theory(equality)]) ).
cnf(242,plain,
divide(identity,divide(identity,X)) = divide(X,divide(identity,X)),
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,217,30]) ).
cnf(244,plain,
$false,
inference('REWRITE',[status(thm)],[13,233,242,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN010-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n008.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:07:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T13:07:53
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-01T13:07:53
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 #||
% 0.44/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/0.61 % SZS output start Refutation
% See solution above
% 0.44/0.61 ||#
% 0.44/0.61
% 0.44/0.61 ; Summary of computation:
% 0.44/0.61 ; 1940 formulas have been input or derived (from 69 formulas).
% 0.44/0.61 ; 244 (13%) were retained. Of these,
% 0.44/0.61 ; 134 (55%) were simplified or subsumed later,
% 0.44/0.61 ; 110 (45%) are still being kept.
% 0.44/0.61 ;
% 0.44/0.61 ; Run time in seconds excluding printing time:
% 0.44/0.61 ; 0.002 2% Read assertion file (1 call)
% 0.44/0.61 ; 0.001 1% Assert (8 calls)
% 0.44/0.61 ; 0.026 20% Process new row (1,579 calls)
% 0.44/0.61 ; 0.011 8% Resolution (136 calls)
% 0.44/0.61 ; 0.016 12% Paramodulation (68 calls)
% 0.44/0.61 ; 0.000 0% Condensing (6 calls)
% 0.44/0.61 ; 0.001 1% Forward subsumption (6 calls)
% 0.44/0.61 ; 0.000 0% Backward subsumption (6 calls)
% 0.44/0.61 ; 0.000 0% Clause clause subsumption (2 calls)
% 0.44/0.61 ; 0.027 20% Forward simplification (1,468 calls)
% 0.44/0.61 ; 0.012 9% Backward simplification (244 calls)
% 0.44/0.61 ; 0.003 2% Ordering (1,587 calls)
% 0.44/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.44/0.61 ; 0.000 0% Purity testing (1 call)
% 0.44/0.61 ; 0.033 25% Other
% 0.44/0.61 ; 0.132 Total
% 0.44/0.61 ; 0.134 Real time
% 0.44/0.61 ;
% 0.44/0.61 ; Term-hash-array has 497 terms in all.
% 0.44/0.61 ; Feature-vector-row-index has 5 entries (5 at peak, 6 added, 1 deleted).
% 0.44/0.61 ; Feature-vector-row-index has 15 nodes (19 at peak, 23 added, 8 deleted).
% 0.44/0.61 ; Retrieved 1 possibly forward subsuming row in 6 calls.
% 0.44/0.61 ; Retrieved 1 possibly backward subsumed row in 6 calls.
% 0.44/0.61 ; Path-index has 250 entries (254 at peak, 525 added, 275 deleted).
% 0.44/0.61 ; Path-index has 364 nodes (416 at peak, 604 added, 240 deleted).
% 0.44/0.61 ; Trie-index has 250 entries (254 at peak, 525 added, 275 deleted).
% 0.44/0.61 ; Trie-index has 981 nodes (1,025 at peak, 2,343 added, 1,362 deleted).
% 0.44/0.61 ; Retrieved 8,461 generalization terms in 5,844 calls.
% 0.44/0.61 ; Retrieved 754 instance terms in 241 calls.
% 0.44/0.61 ; Retrieved 4,221 unifiable terms in 853 calls.
% 0.44/0.61 ;
% 0.44/0.61 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.44/0.61 ; 2 with value 0
% 0.44/0.61 ; The agenda of rows to process has 13 entries:
% 0.44/0.61 ; 6 with value 21 2 with value 24 1 with value 28
% 0.44/0.61 ; 4 with value 22
% 0.44/0.61 ; The agenda of input rows to give has 1 entry:
% 0.44/0.61 ; 1 with value 15
% 0.44/0.61 ; The agenda of rows to give has 75 entries:
% 0.44/0.61 ; 1 with value (4 21) 10 with value (4 26) 2 with value (4 30)
% 0.44/0.61 ; 6 with value (4 22) 6 with value (4 27) 6 with value (4 32)
% 0.44/0.61 ; 9 with value (4 23) 6 with value (4 28) 1 with value (4 33)
% 0.44/0.61 ; 6 with value (4 24) 9 with value (4 29) 1 with value (4 35)
% 0.44/0.61 ; 12 with value (4 25)
% 0.44/0.61 Evaluation took:
% 0.44/0.61 0.135 seconds of real time
% 0.44/0.61 0.117815 seconds of user run time
% 0.44/0.61 0.017107 seconds of system run time
% 0.44/0.61 0 calls to %EVAL
% 0.44/0.61 0 page faults and
% 0.44/0.61 9,770,144 bytes consed.
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.62 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T13:07:53
% 0.44/0.62 :PROOF-FOUND
% 0.44/0.62 *
%------------------------------------------------------------------------------