TSTP Solution File: LAT043-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT043-1 : TPTP v8.1.0. Released v2.5.0.
% 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 : Sun Jul 17 06:42:00 EDT 2022
% Result : Unsatisfiable 0.98s 1.15s
% Output : Refutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 2 RR)
% Number of literals : 27 ( 26 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(idempotence_of_meet,axiom,
meet(X,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(2,plain,
meet(X,meet(X,Y)) = meet(X,Y),
inference('EMBED',[status(thm)],[idempotence_of_meet]) ).
cnf(idempotence_of_join,axiom,
join(X,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(4,plain,
join(X,join(X,Y)) = join(X,Y),
inference('EMBED',[status(thm)],[idempotence_of_join]) ).
cnf(absorption2,axiom,
join(X,meet(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(8,plain,
join(X,join(meet(X,Y),Z)) = join(X,Z),
inference('EMBED',[status(thm)],[absorption2]) ).
cnf(distributivity,axiom,
meet(X,join(Y,Z)) = join(meet(X,Y),meet(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity) ).
cnf(invertability1,axiom,
join(complement(X),X) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability1) ).
cnf(12,plain,
join(complement(X),join(X,Y)) = join(n1,Y),
inference('EMBED',[status(thm)],[invertability1]) ).
cnf(invertability2,axiom,
meet(complement(X),X) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability2) ).
cnf(14,plain,
meet(complement(X),meet(X,Y)) = meet(n0,Y),
inference('EMBED',[status(thm)],[invertability2]) ).
cnf(invertability3,axiom,
complement(complement(X)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability3) ).
cnf(prove_compatability_law,negated_conjecture,
complement(join(c,d)) != meet(complement(c),complement(d)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_compatability_law) ).
cnf(17,plain,
join(n1,X) = n1,
inference('PARAMODULATE',[status(thm)],[4,12,theory(equality)]) ).
cnf(19,plain,
meet(n0,X) = n0,
inference('PARAMODULATE',[status(thm)],[2,14,theory(equality)]) ).
cnf(21,plain,
join(X,n0) = X,
inference('PARAMODULATE',[status(thm)],[absorption2,invertability2,theory(equality)]) ).
cnf(26,plain,
meet(X,n1) = join(meet(X,Y),meet(X,complement(Y))),
inference('PARAMODULATE',[status(thm)],[distributivity,invertability1,theory(equality)]) ).
cnf(30,plain,
meet(X,n1) = join(meet(X,Y),meet(X,n1)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[distributivity,12,theory(equality)]),26,distributivity,17,theory(equality)]) ).
cnf(52,plain,
meet(X,n1) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,idempotence_of_meet,theory(equality)]),absorption2,theory(equality)]) ).
cnf(53,plain,
X = join(meet(X,Y),meet(X,complement(Y))),
inference('REWRITE',[status(thm)],[26,52,theory(equality)]) ).
cnf(54,plain,
join(meet(X,Y),join(meet(X,complement(Y)),Z)) = join(X,Z),
inference('EMBED',[status(thm)],[53]) ).
cnf(63,plain,
complement(X) = meet(complement(X),complement(meet(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[53,14,theory(equality)]),21,19,theory(equality)]) ).
cnf(67,plain,
meet(X,complement(meet(X,Y))) = meet(X,complement(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[53,invertability2,theory(equality)]),21,63,theory(equality)]) ).
cnf(69,plain,
join(X,complement(Y)) = join(complement(Y),meet(X,Y)),
inference('PARAMODULATE',[status(thm)],[8,54,theory(equality)]) ).
cnf(88,plain,
complement(meet(X,Y)) = join(complement(Y),complement(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[53,63,theory(equality)]),69,67,theory(equality)]) ).
cnf(95,plain,
complement(join(complement(Y),complement(X))) = meet(X,Y),
inference('PARAMODULATE',[status(thm)],[invertability3,88,theory(equality)]) ).
cnf(108,plain,
$false,
inference('REWRITE',[status(thm)],[prove_compatability_law,invertability3,95,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT043-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n015.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 : Wed Jun 29 01:43:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.43 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 *
% 0.20/0.44 *
% 0.20/0.45 #<PACKAGE "SNARK-USER">
% 0.20/0.45 *
% 0.20/0.45 SNARK-TPTP-OPTIONS
% 0.20/0.45 *
% 0.20/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.45 (USE-FACTORING :POS)
% 0.20/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.45 *
% 0.20/0.45 "."
% 0.20/0.45 *
% 0.20/0.45 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-29T01:43:25
% 0.20/0.45 ; 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-29T01:43:25
% 0.20/0.46
% 0.20/0.46 ; Recognized commutativity assertion (= (|meet| ?X ?Y) (|meet| ?Y ?X)).
% 0.20/0.46 ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.20/0.46 ; Recognized associativity assertion (= (|meet| (|meet| ?X ?Y) ?Z) (|meet| ?X (|meet| ?Y ?Z))).
% 0.20/0.46 ; Recognized associativity assertion (= (|join| (|join| ?X ?Y) ?Z) (|join| ?X (|join| ?Y ?Z))).
% 0.20/0.46 ; Recognized possible left inverse assertion (= (|join| (|complement| ?X) ?X) |n1|).
% 0.20/0.46 ; Recognized possible left inverse assertion (= (|meet| (|complement| ?X) ?X) |n0|).
% 0.20/0.46 ; Declaring meet to be commutative.
% 0.20/0.46 ; Declaring meet to be associative-commutative.
% 0.20/0.46 ; Declaring join to be commutative.
% 0.98/1.15 ; Declaring join to be associative-commutative.
% 0.98/1.15
% 0.98/1.15 #||
% 0.98/1.15 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.98/1.15 % SZS output start Refutation
% See solution above
% 0.98/1.16 ||#
% 0.98/1.16
% 0.98/1.16 ; Summary of computation:
% 0.98/1.16 ; 2033 formulas have been input or derived (from 35 formulas).
% 0.98/1.16 ; 108 ( 5%) were retained. Of these,
% 0.98/1.16 ; 84 (78%) were simplified or subsumed later,
% 0.98/1.16 ; 24 (22%) are still being kept.
% 0.98/1.16 ;
% 0.98/1.16 ; Run time in seconds excluding printing time:
% 0.98/1.16 ; 0.002 0% Read assertion file (1 call)
% 0.98/1.16 ; 0.001 0% Assert (13 calls)
% 0.98/1.16 ; 0.015 2% Process new row (1,873 calls)
% 0.98/1.16 ; 0.001 0% Resolution (68 calls)
% 0.98/1.16 ; 0.056 8% Paramodulation (34 calls)
% 0.98/1.16 ; 0.002 0% Embedding (53 calls)
% 0.98/1.16 ; 0.584 83% Forward simplification (1,645 calls)
% 0.98/1.16 ; 0.008 1% Backward simplification (59 calls)
% 0.98/1.16 ; 0.004 1% Ordering (793 calls)
% 0.98/1.16 ; 0.000 0% Ordering ac (461 calls)
% 0.98/1.16 ; 0.000 0% Sortal reasoning (32 calls)
% 0.98/1.16 ; 0.000 0% Purity testing (1 call)
% 0.98/1.16 ; 0.031 4% Other
% 0.98/1.16 ; 0.704 Total
% 0.98/1.16 ; 0.712 Real time
% 0.98/1.16 ;
% 0.98/1.16 ; Term-hash-array has 339 terms in all.
% 0.98/1.16 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.98/1.16 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.98/1.16 ; Path-index has 95 entries (226 at peak, 368 added, 273 deleted).
% 0.98/1.16 ; Path-index has 110 nodes (138 at peak, 182 added, 72 deleted).
% 0.98/1.16 ; Trie-index has 95 entries (226 at peak, 368 added, 273 deleted).
% 0.98/1.16 ; Trie-index has 36 nodes (49 at peak, 60 added, 24 deleted).
% 0.98/1.16 ; Retrieved 95,205 generalization terms in 15,572 calls.
% 0.98/1.16 ; Retrieved 240 instance terms in 58 calls.
% 0.98/1.16 ; Retrieved 1,108 unifiable terms in 172 calls.
% 0.98/1.16 ;
% 0.98/1.16 ; The agenda of backward simplifiable rows to process has 18 entries:
% 0.98/1.16 ; 18 with value 0
% 0.98/1.16 ; The agenda of rows to process has 91 entries:
% 0.98/1.16 ; 3 with value 18 10 with value 24 4 with value 31
% 0.98/1.16 ; 1 with value 19 14 with value 26 2 with value 32
% 0.98/1.16 ; 12 with value 20 5 with value 27 4 with value 33
% 0.98/1.16 ; 2 with value 21 1 with value 28 4 with value 35
% 0.98/1.16 ; 11 with value 22 6 with value 29 1 with value 36
% 0.98/1.16 ; 6 with value 23 3 with value 30 2 with value 39
% 0.98/1.16 ; The agenda of rows to give has 13 entries:
% 0.98/1.16 ; 4 with value (4 18) 4 with value (4 32) 2 with value (4 41)
% 0.98/1.16 ; 1 with value (4 26) 2 with value (4 38)
% 0.98/1.16 Evaluation took:
% 0.98/1.16 0.712 seconds of real time
% 0.98/1.16 0.685969 seconds of user run time
% 0.98/1.16 0.026246 seconds of system run time
% 0.98/1.16 [Run times include 0.014 seconds GC run time.]
% 0.98/1.16 0 calls to %EVAL
% 0.98/1.16 0 page faults and
% 0.98/1.16 51,948,008 bytes consed.
% 0.98/1.16 :PROOF-FOUND
% 0.98/1.16 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-29T01:43:26
% 0.98/1.16 :PROOF-FOUND
% 0.98/1.16 *
%------------------------------------------------------------------------------