TSTP Solution File: LAT021-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT021-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n005.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 : Sun Jul 17 06:41:53 EDT 2022
% Result : Unsatisfiable 1.09s 1.33s
% Output : Refutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 2 RR)
% Number of literals : 13 ( 12 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 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 : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(idempotence_of_meet,axiom,
meet(X,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',idempotence_of_meet) ).
cnf(2,plain,
meet(X,meet(X,Y)) = meet(X,Y),
inference('EMBED',[status(thm)],[idempotence_of_meet]) ).
cnf(quasi_lattice1,axiom,
join(meet(X,join(Y,Z)),meet(X,Y)) = meet(X,join(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',quasi_lattice1) ).
cnf(quasi_lattice2,axiom,
meet(join(X,meet(Y,Z)),join(X,Y)) = join(X,meet(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT004-0.ax',quasi_lattice2) ).
cnf(8,plain,
meet(join(X,meet(Y,Z)),meet(join(X,Y),U)) = meet(join(X,meet(Y,Z)),U),
inference('EMBED',[status(thm)],[quasi_lattice2]) ).
cnf(bowden,hypothesis,
join(X,join(meet(Y,Z),meet(join(X,Y),Z))) = join(X,meet(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bowden) ).
cnf(10,plain,
join(X,meet(Y,join(Z,X))) = join(X,meet(Y,Z)),
inference('REWRITE',[status(thm)],[bowden,quasi_lattice1,theory(equality)]) ).
cnf(prove_distributivity,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(30,plain,
join(meet(X,Y),meet(Y,Z)) = meet(Y,join(Z,meet(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quasi_lattice1,2,theory(equality)]),10,theory(equality)]) ).
cnf(64,plain,
meet(join(X,Y),join(meet(Y,Z),meet(X,Z))) = meet(join(X,Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[quasi_lattice2,quasi_lattice1,theory(equality)]),30,10,theory(equality)]) ).
cnf(116,plain,
meet(join(meet(X,Y),meet(U,Z)),join(Z,X)) = join(meet(X,Y),meet(U,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]),quasi_lattice2,theory(equality)]) ).
cnf(118,plain,
join(meet(X,Y),meet(Y,Z)) = meet(Y,join(Z,X)),
inference('REWRITE',[status(thm)],[64,116,theory(equality)]) ).
cnf(122,plain,
$false,
inference('REWRITE',[status(thm)],[prove_distributivity,118,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LAT021-1 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.07 % Command : run-snark %s %d
% 0.07/0.26 % Computer : n005.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Thu Jun 30 03:09:07 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.10/0.32 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.33 *
% 0.10/0.33 *
% 0.10/0.33 #<PACKAGE "SNARK-USER">
% 0.10/0.33 *
% 0.10/0.33 SNARK-TPTP-OPTIONS
% 0.10/0.33 *
% 0.10/0.33 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.10/0.33 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.10/0.33 (USE-FACTORING :POS)
% 0.10/0.33 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.10/0.33 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.10/0.33 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.10/0.33 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.10/0.33 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.10/0.33 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.10/0.33 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.10/0.33 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.10/0.33 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.10/0.33 (DECLARE-TPTP-SYMBOLS2))
% 0.10/0.33 *
% 0.10/0.33 "."
% 0.10/0.33 *
% 0.10/0.33 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T03:09:07
% 0.10/0.33 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-06-30T03:09:07
% 0.10/0.34
% 0.10/0.34 ; Recognized commutativity assertion (= (|meet| ?X ?Y) (|meet| ?Y ?X)).
% 0.10/0.34 ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.10/0.34 ; Recognized associativity assertion (= (|meet| (|meet| ?X ?Y) ?Z) (|meet| ?X (|meet| ?Y ?Z))).
% 0.10/0.34 ; Recognized associativity assertion (= (|join| (|join| ?X ?Y) ?Z) (|join| ?X (|join| ?Y ?Z))).
% 0.10/0.34 ; Declaring meet to be commutative.
% 0.10/0.34 ; Declaring meet to be associative-commutative.
% 0.10/0.34 ; Declaring join to be commutative.
% 1.09/1.33 ; Declaring join to be associative-commutative.
% 1.09/1.33
% 1.09/1.33 #||
% 1.09/1.33 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.09/1.33 % SZS output start Refutation
% See solution above
% 1.09/1.33 ||#
% 1.09/1.33
% 1.09/1.33 ; Summary of computation:
% 1.09/1.33 ; 741 formulas have been input or derived (from 12 formulas).
% 1.09/1.33 ; 122 (16%) were retained. Of these,
% 1.09/1.33 ; 106 (87%) were simplified or subsumed later,
% 1.09/1.33 ; 16 (13%) are still being kept.
% 1.09/1.33 ;
% 1.09/1.33 ; Run time in seconds excluding printing time:
% 1.09/1.33 ; 0.001 0% Read assertion file (1 call)
% 1.09/1.33 ; 0.000 0% Assert (10 calls)
% 1.09/1.33 ; 0.006 1% Process new row (677 calls)
% 1.09/1.33 ; 0.000 0% Resolution (22 calls)
% 1.09/1.33 ; 0.018 2% Paramodulation (11 calls)
% 1.09/1.33 ; 0.001 0% Embedding (60 calls)
% 1.09/1.33 ; 0.906 91% Forward simplification (618 calls)
% 1.09/1.33 ; 0.030 3% Backward simplification (62 calls)
% 1.09/1.33 ; 0.006 1% Ordering (2,223 calls)
% 1.09/1.33 ; 0.015 2% Ordering ac (2,160 calls)
% 1.09/1.33 ; 0.000 0% Sortal reasoning (32 calls)
% 1.09/1.33 ; 0.000 0% Purity testing (1 call)
% 1.09/1.33 ; 0.015 2% Other
% 1.09/1.33 ; 0.998 Total
% 1.09/1.33 ; 0.999 Real time
% 1.09/1.33 ;
% 1.09/1.33 ; Term-hash-array has 431 terms in all.
% 1.09/1.33 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.09/1.33 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.09/1.33 ; Path-index has 52 entries (389 at peak, 442 added, 390 deleted).
% 1.09/1.33 ; Path-index has 36 nodes (62 at peak, 67 added, 31 deleted).
% 1.09/1.33 ; Trie-index has 52 entries (389 at peak, 442 added, 390 deleted).
% 1.09/1.33 ; Trie-index has 14 nodes (15 at peak, 18 added, 4 deleted).
% 1.09/1.33 ; Retrieved 72,887 generalization terms in 8,309 calls.
% 1.09/1.33 ; Retrieved 1,692 instance terms in 63 calls.
% 1.09/1.33 ; Retrieved 414 unifiable terms in 59 calls.
% 1.09/1.33 ;
% 1.09/1.33 ; The agenda of rows to process has 63 entries:
% 1.09/1.33 ; 7 with value 30 6 with value 37 1 with value 44
% 1.09/1.33 ; 4 with value 31 5 with value 38 1 with value 45
% 1.09/1.33 ; 4 with value 32 2 with value 39 1 with value 46
% 1.09/1.33 ; 2 with value 33 5 with value 40 1 with value 47
% 1.09/1.33 ; 4 with value 34 3 with value 41 1 with value 48
% 1.09/1.33 ; 3 with value 35 2 with value 42 2 with value 49
% 1.09/1.33 ; 6 with value 36 3 with value 43
% 1.09/1.33 ; The agenda of rows to give has 11 entries:
% 1.09/1.33 ; 2 with value (4 17) 2 with value (4 21) 2 with value (4 25)
% 1.09/1.33 ; 4 with value (4 19) 1 with value (4 23)
% 1.09/1.33 Evaluation took:
% 1.09/1.33 0.999 seconds of real time
% 1.09/1.33 0.986989 seconds of user run time
% 1.09/1.33 0.012606 seconds of system run time
% 1.09/1.33 [Run times include 0.024 seconds GC run time.]
% 1.09/1.33 0 calls to %EVAL
% 1.09/1.33 0 page faults and
% 1.09/1.33 148,035,944 bytes consed.
% 1.09/1.33 :PROOF-FOUND
% 1.09/1.33 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T03:09:08
% 1.09/1.33 :PROOF-FOUND
% 1.09/1.33 *
%------------------------------------------------------------------------------