TSTP Solution File: LAT029-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT029-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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:55 EDT 2022
% Result : Unsatisfiable 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of clauses : 59 ( 56 unt; 0 nHn; 5 RR)
% Number of literals : 65 ( 64 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 107 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_absorbtion_1,axiom,
join(meet(X,Y),meet(X,join(X,Y))) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_1) ).
cnf(wal_absorbtion_2,axiom,
join(meet(X,X),meet(Y,join(X,X))) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_2) ).
cnf(wal_absorbtion_3,axiom,
join(meet(X,Y),meet(Y,join(X,Y))) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_3) ).
cnf(wal_absorbtion_4,axiom,
meet(meet(join(X,Y),join(Z,X)),X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_4) ).
cnf(wal_absorbtion_5,axiom,
join(join(meet(X,Y),meet(Z,X)),X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_5) ).
cnf(prove_normal_axioms,negated_conjecture,
( meet(a,a) != a
| meet(b,a) != meet(a,b)
| join(a,a) != a
| join(b,a) != join(a,b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_normal_axioms) ).
cnf(13,plain,
join(meet(X,X),join(X,X)) = X,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_2,wal_absorbtion_4,theory(equality)]) ).
cnf(15,plain,
meet(meet(X,join(Y,meet(Z,X))),meet(Z,X)) = meet(Z,X),
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_4,wal_absorbtion_3,theory(equality)]) ).
cnf(16,plain,
join(X,meet(X,join(meet(join(X,Y),join(Z,X)),X))) = X,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_3,wal_absorbtion_4,theory(equality)]) ).
cnf(21,plain,
meet(meet(join(X,Y),X),X) = X,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_4,wal_absorbtion_5,theory(equality)]) ).
cnf(22,plain,
join(join(meet(X,Y),X),X) = X,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_5,wal_absorbtion_4,theory(equality)]) ).
cnf(28,plain,
join(meet(meet(X,X),join(X,X)),meet(join(X,X),X)) = join(X,X),
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_3,13,theory(equality)]) ).
cnf(29,plain,
join(meet(meet(X,X),join(X,X)),meet(meet(X,X),X)) = meet(X,X),
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,13,theory(equality)]) ).
cnf(30,plain,
meet(meet(X,meet(X,Y)),meet(X,Y)) = meet(X,Y),
inference('PARAMODULATE',[status(thm)],[21,wal_absorbtion_1,theory(equality)]) ).
cnf(38,plain,
join(join(X,meet(join(X,Y),X)),meet(join(X,Y),X)) = meet(join(X,Y),X),
inference('PARAMODULATE',[status(thm)],[22,21,theory(equality)]) ).
cnf(39,plain,
join(meet(join(meet(X,Y),X),X),meet(join(meet(X,Y),X),X)) = join(meet(X,Y),X),
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,22,theory(equality)]) ).
cnf(42,plain,
meet(X,X) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,21,theory(equality)]),21,theory(equality)]) ).
cnf(43,plain,
join(X,meet(Y,join(X,X))) = X,
inference('REWRITE',[status(thm)],[wal_absorbtion_2,42,theory(equality)]) ).
cnf(48,plain,
join(meet(X,join(X,X)),meet(join(X,X),X)) = join(X,X),
inference('REWRITE',[status(thm)],[28,42,theory(equality)]) ).
cnf(49,plain,
join(meet(X,join(X,X)),X) = X,
inference('REWRITE',[status(thm)],[29,42,theory(equality)]) ).
cnf(51,plain,
( meet(b,a) != meet(a,b)
| join(a,a) != a
| join(b,a) != join(a,b) ),
inference('REWRITE',[status(thm)],[prove_normal_axioms,42,theory(equality)]) ).
cnf(52,plain,
join(join(meet(X,Y),meet(X,meet(X,Y))),meet(X,meet(X,Y))) = meet(X,meet(X,Y)),
inference('PARAMODULATE',[status(thm)],[22,30,theory(equality)]) ).
cnf(56,plain,
meet(meet(X,join(Y,X)),X) = X,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_4,43,theory(equality)]) ).
cnf(59,plain,
meet(join(X,X),X) = X,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_4,42,theory(equality)]) ).
cnf(60,plain,
X = join(X,X),
inference('REWRITE',[status(thm)],[48,49,59,theory(equality)]) ).
cnf(61,plain,
meet(join(meet(X,Y),X),X) = join(meet(X,Y),X),
inference('REWRITE',[status(thm)],[39,60,theory(equality)]) ).
cnf(64,plain,
join(X,meet(Y,X)) = X,
inference('REWRITE',[status(thm)],[43,60,theory(equality)]) ).
cnf(65,plain,
meet(X,Y) = meet(X,meet(X,Y)),
inference('REWRITE',[status(thm)],[52,64,theory(equality)]) ).
cnf(66,plain,
X = meet(join(X,Y),X),
inference('REWRITE',[status(thm)],[38,64,theory(equality)]) ).
cnf(69,plain,
( meet(b,a) != meet(a,b)
| join(b,a) != join(a,b) ),
inference('REWRITE',[status(thm)],[51,60,theory(equality)]) ).
cnf(70,plain,
meet(X,Y) = meet(Y,meet(X,Y)),
inference('PARAMODULATE',[status(thm)],[66,wal_absorbtion_3,theory(equality)]) ).
cnf(73,plain,
join(X,meet(X,join(join(X,Y),X))) = X,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_3,66,theory(equality)]) ).
cnf(75,plain,
join(meet(X,Y),X) = meet(X,join(meet(X,Y),X)),
inference('PARAMODULATE',[status(thm)],[66,22,theory(equality)]) ).
cnf(85,plain,
join(X,meet(meet(X,join(Y,X)),join(meet(X,join(Y,X)),X))) = meet(X,join(Y,X)),
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,56,theory(equality)]) ).
cnf(88,plain,
join(join(meet(X,Y),meet(Z,Y)),Y) = Y,
inference('PARAMODULATE',[status(thm)],[wal_absorbtion_5,70,theory(equality)]) ).
cnf(94,plain,
meet(join(X,join(X,Y)),join(X,Y)) = join(X,join(X,Y)),
inference('PARAMODULATE',[status(thm)],[61,66,theory(equality)]) ).
cnf(95,plain,
meet(join(X,meet(X,join(Y,X))),meet(X,join(Y,X))) = join(X,meet(X,join(Y,X))),
inference('PARAMODULATE',[status(thm)],[61,56,theory(equality)]) ).
cnf(100,plain,
join(meet(X,join(join(X,Y),X)),X) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,73,theory(equality)]),42,65,theory(equality)]) ).
cnf(101,plain,
X = meet(X,join(join(X,Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wal_absorbtion_3,73,theory(equality)]),100,56,65,theory(equality)]) ).
cnf(102,plain,
X = meet(join(join(X,Y),X),X),
inference('PARAMODULATE',[status(thm)],[70,101,theory(equality)]) ).
cnf(108,plain,
meet(X,Y) = meet(join(X,meet(X,Y)),meet(X,Y)),
inference('PARAMODULATE',[status(thm)],[102,wal_absorbtion_1,theory(equality)]) ).
cnf(109,plain,
meet(X,join(Y,X)) = join(X,meet(X,join(Y,X))),
inference('REWRITE',[status(thm)],[95,108,theory(equality)]) ).
cnf(110,plain,
meet(X,join(meet(join(X,Y),join(Z,X)),X)) = X,
inference('REWRITE',[status(thm)],[16,109,theory(equality)]) ).
cnf(121,plain,
join(meet(X,join(Y,X)),X) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[110,64,theory(equality)]),75,theory(equality)]) ).
cnf(122,plain,
X = meet(X,join(Y,X)),
inference('REWRITE',[status(thm)],[85,60,56,121,theory(equality)]) ).
cnf(123,plain,
join(meet(X,Y),X) = X,
inference('REWRITE',[status(thm)],[75,122,theory(equality)]) ).
cnf(124,plain,
X = meet(join(Y,X),X),
inference('PARAMODULATE',[status(thm)],[70,122,theory(equality)]) ).
cnf(125,plain,
join(X,Y) = join(X,join(X,Y)),
inference('REWRITE',[status(thm)],[94,124,theory(equality)]) ).
cnf(132,plain,
join(join(X,meet(Y,join(Z,X))),join(Z,X)) = join(Z,X),
inference('PARAMODULATE',[status(thm)],[88,122,theory(equality)]) ).
cnf(134,plain,
meet(meet(X,Y),X) = meet(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,123,theory(equality)]),60,theory(equality)]) ).
cnf(135,plain,
meet(X,join(X,Y)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,125,theory(equality)]),60,theory(equality)]) ).
cnf(136,plain,
join(join(X,Y),X) = join(X,Y),
inference('PARAMODULATE',[status(thm)],[64,135,theory(equality)]) ).
cnf(140,plain,
join(X,meet(X,Y)) = X,
inference('PARAMODULATE',[status(thm)],[64,134,theory(equality)]) ).
cnf(194,plain,
meet(meet(X,Y),meet(Y,X)) = meet(Y,X),
inference('PARAMODULATE',[status(thm)],[15,140,theory(equality)]) ).
cnf(204,plain,
meet(X,Y) = meet(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[134,194,theory(equality)]),194,theory(equality)]) ).
cnf(205,plain,
join(b,a) != join(a,b),
inference('REWRITE',[status(thm)],[69,204,theory(equality)]) ).
cnf(504,plain,
join(join(X,Y),join(Y,X)) = join(Y,X),
inference('PARAMODULATE',[status(thm)],[132,135,theory(equality)]) ).
cnf(516,plain,
join(X,Y) = join(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[136,504,theory(equality)]),504,theory(equality)]) ).
cnf(517,plain,
$false,
inference('REWRITE',[status(thm)],[205,516,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT029-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n024.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 22:00:15 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.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-29T22:00:15
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-29T22:00:15
% 0.55/0.73
% 0.55/0.73
% 0.55/0.73 #||
% 0.55/0.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.73 % SZS output start Refutation
% See solution above
% 0.55/0.74 ||#
% 0.55/0.74
% 0.55/0.74 ; Summary of computation:
% 0.55/0.74 ; 2657 formulas have been input or derived (from 71 formulas).
% 0.55/0.74 ; 517 (19%) were retained. Of these,
% 0.55/0.74 ; 102 (20%) were simplified or subsumed later,
% 0.55/0.74 ; 415 (80%) are still being kept.
% 0.55/0.74 ;
% 0.55/0.74 ; Run time in seconds excluding printing time:
% 0.55/0.74 ; 0.002 1% Read assertion file (1 call)
% 0.55/0.74 ; 0.000 0% Assert (6 calls)
% 0.55/0.74 ; 0.055 21% Process new row (2,293 calls)
% 0.55/0.74 ; 0.002 1% Resolution (140 calls)
% 0.55/0.74 ; 0.053 21% Paramodulation (70 calls)
% 0.55/0.74 ; 0.000 0% Condensing (3 calls)
% 0.55/0.74 ; 0.000 0% Forward subsumption (3 calls)
% 0.55/0.74 ; 0.000 0% Backward subsumption (3 calls)
% 0.55/0.74 ; 0.072 28% Forward simplification (2,265 calls)
% 0.55/0.74 ; 0.023 9% Backward simplification (517 calls)
% 0.55/0.74 ; 0.013 5% Ordering (4,053 calls)
% 0.55/0.74 ; 0.000 0% Sortal reasoning (32 calls)
% 0.55/0.74 ; 0.000 0% Purity testing (1 call)
% 0.55/0.74 ; 0.037 14% Other
% 0.55/0.74 ; 0.257 Total
% 0.55/0.74 ; 0.262 Real time
% 0.55/0.74 ;
% 0.55/0.74 ; Term-hash-array has 1,626 terms in all.
% 0.55/0.74 ; Feature-vector-row-index has 0 entries (1 at peak, 3 added, 3 deleted).
% 0.55/0.74 ; Feature-vector-row-index has 1 node (13 at peak, 37 added, 36 deleted).
% 0.55/0.74 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.55/0.74 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.55/0.74 ; Path-index has 1,357 entries (1,362 at peak, 1,661 added, 304 deleted).
% 0.55/0.74 ; Path-index has 3,339 nodes (3,349 at peak, 3,680 added, 341 deleted).
% 0.55/0.74 ; Trie-index has 1,357 entries (1,362 at peak, 1,661 added, 304 deleted).
% 0.55/0.74 ; Trie-index has 6,586 nodes (6,597 at peak, 8,212 added, 1,626 deleted).
% 0.55/0.74 ; Retrieved 34,981 generalization terms in 14,837 calls.
% 0.55/0.74 ; Retrieved 1,967 instance terms in 513 calls.
% 0.55/0.74 ; Retrieved 6,064 unifiable terms in 453 calls.
% 0.55/0.74 ;
% 0.55/0.74 ; The agenda of rows to process has 74 entries:
% 0.55/0.74 ; 6 with value 21 3 with value 30 3 with value 36
% 0.55/0.74 ; 8 with value 24 1 with value 31 1 with value 37
% 0.55/0.74 ; 8 with value 25 3 with value 32 1 with value 39
% 0.55/0.74 ; 5 with value 26 8 with value 33 3 with value 40
% 0.55/0.74 ; 1 with value 27 2 with value 35 2 with value 42
% 0.55/0.74 ; 19 with value 29
% 0.55/0.74 ; The agenda of rows to give has 364 entries:
% 0.55/0.74 ; 1 with value (4 16) 4 with value (4 35) 3 with value (4 47)
% 0.55/0.74 ; 11 with value (4 25) 5 with value (4 36) 1 with value (4 48)
% 0.55/0.74 ; 22 with value (4 26) 2 with value (4 37) 7 with value (4 49)
% 0.55/0.74 ; 30 with value (4 27) 5 with value (4 38) 12 with value (4 50)
% 0.55/0.74 ; 13 with value (4 28) 13 with value (4 39) 21 with value (4 51)
% 0.55/0.74 ; 19 with value (4 29) 50 with value (4 40) 8 with value (4 52)
% 0.55/0.74 ; 17 with value (4 30) 2 with value (4 41) 18 with value (4 53)
% 0.55/0.74 ; 3 with value (4 31) 16 with value (4 42) 2 with value (4 54)
% 0.55/0.74 ; 8 with value (4 32) 36 with value (4 43) 1 with value (4 55)
% 0.55/0.74 ; 4 with value (4 33) 15 with value (4 44) 3 with value (4 64)
% 0.55/0.74 ; 5 with value (4 34) 5 with value (4 46) 2 with value (4 66)
% 0.55/0.74 Evaluation took:
% 0.55/0.74 0.263 seconds of real time
% 0.55/0.74 0.229881 seconds of user run time
% 0.55/0.74 0.033303 seconds of system run time
% 0.55/0.74 [Run times include 0.01 seconds GC run time.]
% 0.55/0.74 0 calls to %EVAL
% 0.55/0.74 0 page faults and
% 0.55/0.74 19,670,512 bytes consed.
% 0.55/0.74 :PROOF-FOUND
% 0.55/0.74 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-29T22:00:16
% 0.55/0.74 :PROOF-FOUND
% 0.55/0.74 *
%------------------------------------------------------------------------------