%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP147-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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 11:37:08 EDT 2022
% Result : Unsatisfiable 0.67s 0.91s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 6 RR)
% Number of literals : 10 ( 9 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lub_absorbtion,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(ax_lub1b_1,hypothesis,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1b_1) ).
cnf(ax_lub1b_2,hypothesis,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1b_2) ).
cnf(prove_ax_lub1b,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1b) ).
cnf(21,plain,
least_upper_bound(c,b) = c,
inference('PARAMODULATE',[status(thm)],[lub_absorbtion,ax_lub1b_2,theory(equality)]) ).
cnf(22,plain,
least_upper_bound(c,least_upper_bound(b,X)) = least_upper_bound(c,X),
inference('EMBED',[status(thm)],[21]) ).
cnf(23,plain,
least_upper_bound(c,a) = c,
inference('PARAMODULATE',[status(thm)],[lub_absorbtion,ax_lub1b_1,theory(equality)]) ).
cnf(121,plain,
greatest_lower_bound(least_upper_bound(X,b),least_upper_bound(c,X)) = least_upper_bound(X,b),
inference('PARAMODULATE',[status(thm)],[glb_absorbtion,22,theory(equality)]) ).
cnf(460,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[121,23,theory(equality)]),prove_ax_lub1b]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP147-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n015.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 : 600
% 0.12/0.33 % DateTime : Mon Jun 13 16:48:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T16:48:23
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-13T16:48:23
% 0.19/0.47
% 0.19/0.47 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.47 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.19/0.47 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.19/0.47 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.19/0.47 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.19/0.47 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.19/0.47 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.19/0.47 ; Declaring greatest_lower_bound to be commutative.
% 0.19/0.47 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.19/0.47 ; Declaring least_upper_bound to be commutative.
% 0.67/0.91 ; Declaring least_upper_bound to be associative-commutative.
% 0.67/0.91
% 0.67/0.91 #||
% 0.67/0.91 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.67/0.91 % SZS output start Refutation
% See solution above
% 0.67/0.91 ||#
% 0.67/0.91
% 0.67/0.91 ; Summary of computation:
% 0.67/0.91 ; 2378 formulas have been input or derived (from 64 formulas).
% 0.67/0.91 ; 460 (19%) were retained. Of these,
% 0.67/0.91 ; 30 ( 7%) were simplified or subsumed later,
% 0.67/0.91 ; 430 (93%) are still being kept.
% 0.67/0.91 ;
% 0.67/0.91 ; Run time in seconds excluding printing time:
% 0.67/0.91 ; 0.004 1% Read assertion file (1 call)
% 0.67/0.91 ; 0.001 0% Assert (18 calls)
% 0.67/0.91 ; 0.046 10% Process new row (2,230 calls)
% 0.67/0.91 ; 0.006 1% Resolution (126 calls)
% 0.67/0.91 ; 0.045 10% Paramodulation (63 calls)
% 0.67/0.91 ; 0.004 1% Embedding (217 calls)
% 0.67/0.91 ; 0.278 62% Forward simplification (2,017 calls)
% 0.67/0.91 ; 0.010 2% Backward simplification (247 calls)
% 0.67/0.91 ; 0.011 2% Ordering (3,176 calls)
% 0.67/0.91 ; 0.015 3% Ordering ac (968 calls)
% 0.67/0.91 ; 0.000 0% Sortal reasoning (32 calls)
% 0.67/0.91 ; 0.000 0% Purity testing (1 call)
% 0.67/0.91 ; 0.031 7% Other
% 0.67/0.91 ; 0.451 Total
% 0.67/0.91 ; 0.453 Real time
% 0.67/0.91 ;
% 0.67/0.91 ; Term-hash-array has 1,337 terms in all.
% 0.67/0.91 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.67/0.91 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.67/0.91 ; Path-index has 1,268 entries (1,268 at peak, 1,347 added, 79 deleted).
% 0.67/0.91 ; Path-index has 653 nodes (653 at peak, 665 added, 12 deleted).
% 0.67/0.91 ; Trie-index has 1,268 entries (1,268 at peak, 1,347 added, 79 deleted).
% 0.67/0.91 ; Trie-index has 516 nodes (516 at peak, 559 added, 43 deleted).
% 0.67/0.91 ; Retrieved 386,552 generalization terms in 19,247 calls.
% 0.67/0.91 ; Retrieved 530 instance terms in 270 calls.
% 0.67/0.91 ; Retrieved 8,182 unifiable terms in 350 calls.
% 0.67/0.91 ;
% 0.67/0.91 ; The agenda of rows to process has 60 entries:
% 0.67/0.91 ; 1 with value 15 2 with value 24 4 with value 31
% 0.67/0.91 ; 3 with value 16 5 with value 25 5 with value 32
% 0.67/0.91 ; 4 with value 19 4 with value 26 4 with value 34
% 0.67/0.91 ; 3 with value 20 2 with value 27 1 with value 36
% 0.67/0.91 ; 5 with value 21 7 with value 28 1 with value 37
% 0.67/0.91 ; 4 with value 22 1 with value 30 4 with value 38
% 0.67/0.91 ; The agenda of rows to give has 366 entries:
% 0.67/0.91 ; 21 with value (4 16) 16 with value (4 22) 18 with value (4 28)
% 0.67/0.91 ; 16 with value (4 17) 54 with value (4 23) 12 with value (4 29)
% 0.67/0.91 ; 28 with value (4 18) 34 with value (4 24) 8 with value (4 30)
% 0.67/0.91 ; 42 with value (4 19) 28 with value (4 25) 4 with value (4 31)
% 0.67/0.91 ; 15 with value (4 20) 24 with value (4 26) 4 with value (4 33)
% 0.67/0.91 ; 18 with value (4 21) 16 with value (4 27) 8 with value (4 36)
% 0.67/0.91 Evaluation took:
% 0.67/0.91 0.453 seconds of real time
% 0.67/0.91 0.423948 seconds of user run time
% 0.67/0.91 0.029186 seconds of system run time
% 0.67/0.91 [Run times include 0.005 seconds GC run time.]
% 0.67/0.91 0 calls to %EVAL
% 0.67/0.91 0 page faults and
% 0.67/0.91 23,835,296 bytes consed.
% 0.67/0.91 :PROOF-FOUND
% 0.67/0.91 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T16:48:23
% 0.67/0.91 :PROOF-FOUND
% 0.67/0.91 *
%------------------------------------------------------------------------------