TSTP Solution File: REL006+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : REL006+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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 : Mon Jul 18 19:59:09 EDT 2022
% Result : Theorem 16.64s 16.80s
% Output : Refutation 16.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 18 RR)
% Number of literals : 50 ( 49 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
X = join(complement(join(complement(X),complement(Y))),complement(join(complement(X),Y))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
cnf(2,plain,
join(complement(join(complement(X),complement(Y))),join(complement(join(complement(X),Y)),Z)) = join(X,Z),
inference('EMBED',[status(thm)],[1]) ).
cnf(3,axiom,
meet(X,Y) = complement(join(complement(X),complement(Y))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
cnf(8,axiom,
converse(converse(X)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
cnf(9,axiom,
converse(join(X,Y)) = join(converse(X),converse(Y)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
cnf(10,plain,
join(converse(X),join(converse(Y),Z)) = join(converse(join(X,Y)),Z),
inference('EMBED',[status(thm)],[9]) ).
cnf(12,axiom,
join(composition(converse(X),complement(composition(X,Y))),complement(Y)) = complement(Y),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
cnf(13,plain,
join(composition(converse(X),complement(composition(X,Y))),join(complement(Y),Z)) = join(complement(Y),Z),
inference('EMBED',[status(thm)],[12]) ).
cnf(14,axiom,
top = join(X,complement(X)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_top) ).
cnf(15,plain,
join(X,join(complement(X),Y)) = join(top,Y),
inference('EMBED',[status(thm)],[14]) ).
cnf(16,axiom,
zero = meet(X,complement(X)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
cnf(17,plain,
zero = complement(top),
inference('REWRITE',[status(thm)],[16,3,theory(equality)]) ).
cnf(18,negated_conjecture,
meet(converse('SKOLEMAAAV1'),'SKOLEMAAAV2') = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(19,plain,
complement(join(complement(converse('SKOLEMAAAV1')),complement('SKOLEMAAAV2'))) = zero,
inference('REWRITE',[status(thm)],[18,3,theory(equality)]) ).
cnf(20,negated_conjecture,
meet('SKOLEMAAAV1',converse('SKOLEMAAAV2')) != zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(21,plain,
complement(join(complement('SKOLEMAAAV1'),complement(converse('SKOLEMAAAV2')))) != zero,
inference('REWRITE',[status(thm)],[20,3,theory(equality)]) ).
cnf(28,plain,
join(top,X) = join(top,complement(join(Y,complement(join(X,Y))))),
inference('PARAMODULATE',[status(thm)],[15,15,theory(equality)]) ).
cnf(30,plain,
converse(join(converse(X),Y)) = join(X,converse(Y)),
inference('PARAMODULATE',[status(thm)],[9,8,theory(equality)]) ).
cnf(32,plain,
join(converse(join(X,Y)),complement(converse(X))) = join(top,converse(Y)),
inference('PARAMODULATE',[status(thm)],[15,10,theory(equality)]) ).
cnf(72,plain,
join(complement(X),complement(composition(converse(Y),complement(composition(Y,X))))) = join(top,complement(X)),
inference('PARAMODULATE',[status(thm)],[15,13,theory(equality)]) ).
cnf(78,plain,
'SKOLEMAAAV2' = join(zero,complement(join(complement('SKOLEMAAAV2'),converse('SKOLEMAAAV1')))),
inference('PARAMODULATE',[status(thm)],[1,19,theory(equality)]) ).
cnf(82,plain,
top = join(complement(join(zero,complement(X))),complement(join(zero,X))),
inference('PARAMODULATE',[status(thm)],[1,17,theory(equality)]) ).
cnf(88,plain,
complement(X) = join(zero,complement(join(complement(complement(X)),X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,14,theory(equality)]),17,theory(equality)]) ).
cnf(94,plain,
X = complement(complement(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,14,theory(equality)]),88,17,theory(equality)]) ).
cnf(97,plain,
X = join(complement(join(complement(X),complement(join(X,Y)))),complement(join(top,Y))),
inference('PARAMODULATE',[status(thm)],[1,15,theory(equality)]) ).
cnf(99,plain,
join(complement(converse('SKOLEMAAAV1')),complement('SKOLEMAAAV2')) = top,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,19,theory(equality)]),82,theory(equality)]) ).
cnf(100,plain,
join(complement(converse('SKOLEMAAAV1')),join(complement('SKOLEMAAAV2'),X)) = join(top,X),
inference('EMBED',[status(thm)],[99]) ).
cnf(101,plain,
X = join(complement(join(top,complement(X))),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,12,theory(equality)]),94,72,theory(equality)]) ).
cnf(117,plain,
join(top,complement(X)) = join(top,complement(join(complement(Y),X))),
inference('PARAMODULATE',[status(thm)],[15,2,theory(equality)]) ).
cnf(119,plain,
join(top,X) = join(top,complement(Y)),
inference('REWRITE',[status(thm)],[28,117,theory(equality)]) ).
cnf(136,plain,
complement(X) = join(complement(join(complement(Y),X)),complement(join(X,Y))),
inference('PARAMODULATE',[status(thm)],[1,94,theory(equality)]) ).
cnf(140,plain,
top = join(top,X),
inference('PARAMODULATE',[status(thm)],[14,119,theory(equality)]) ).
cnf(150,plain,
join(converse(join(X,Y)),complement(converse(X))) = top,
inference('REWRITE',[status(thm)],[32,140,theory(equality)]) ).
cnf(160,plain,
X = join(zero,X),
inference('REWRITE',[status(thm)],[101,17,140,theory(equality)]) ).
cnf(165,plain,
'SKOLEMAAAV2' = complement(join(complement('SKOLEMAAAV2'),converse('SKOLEMAAAV1'))),
inference('REWRITE',[status(thm)],[78,160,theory(equality)]) ).
cnf(167,plain,
X = complement(join(complement(X),complement(join(X,Y)))),
inference('REWRITE',[status(thm)],[97,160,17,140,theory(equality)]) ).
cnf(176,plain,
converse(join(converse(top),'SKOLEMAAAV1')) = top,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,100,theory(equality)]),140,30,theory(equality)]) ).
cnf(177,plain,
join(complement('SKOLEMAAAV2'),converse('SKOLEMAAAV1')) = complement('SKOLEMAAAV2'),
inference('PARAMODULATE',[status(thm)],[94,165,theory(equality)]) ).
cnf(179,plain,
converse(top) = join(converse(top),'SKOLEMAAAV1'),
inference('PARAMODULATE',[status(thm)],[8,176,theory(equality)]) ).
cnf(180,plain,
join(converse(top),join('SKOLEMAAAV1',X)) = join(converse(top),X),
inference('EMBED',[status(thm)],[179]) ).
cnf(185,plain,
top = converse(top),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[140,180,theory(equality)]),140,30,theory(equality)]) ).
cnf(271,plain,
converse(join(converse(complement('SKOLEMAAAV1')),complement('SKOLEMAAAV2'))) = top,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[150,177,theory(equality)]),30,8,theory(equality)]) ).
cnf(378,plain,
join(complement(X),complement(join(X,Y))) = complement(X),
inference('PARAMODULATE',[status(thm)],[94,167,theory(equality)]) ).
cnf(417,plain,
join(X,complement(join(complement(X),Y))) = X,
inference('PARAMODULATE',[status(thm)],[378,94,theory(equality)]) ).
cnf(1211,plain,
top = join(converse(complement('SKOLEMAAAV1')),complement('SKOLEMAAAV2')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,271,theory(equality)]),185,theory(equality)]) ).
cnf(3212,plain,
join(complement(X),Y) = join(Y,complement(join(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[136,136,theory(equality)]),417,94,theory(equality)]) ).
cnf(3455,plain,
converse(join(converse('SKOLEMAAAV2'),complement('SKOLEMAAAV1'))) = converse(complement('SKOLEMAAAV1')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3212,1211,theory(equality)]),160,17,30,94,theory(equality)]) ).
cnf(3631,plain,
complement('SKOLEMAAAV1') = join(converse('SKOLEMAAAV2'),complement('SKOLEMAAAV1')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,3455,theory(equality)]),8,theory(equality)]) ).
cnf(3637,plain,
join(complement('SKOLEMAAAV1'),complement(converse('SKOLEMAAAV2'))) = top,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3212,3631,theory(equality)]),94,theory(equality)]) ).
cnf(3639,plain,
$false,
inference('REWRITE',[status(thm)],[21,17,3637,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : REL006+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n026.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 8 11:41:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-07-08T11:41:55
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-07-08T11:41:55
% 0.20/0.49
% 0.20/0.49 ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.20/0.49 ; Recognized associativity assertion (= (|join| ?X (|join| ?Y ?Z)) (|join| (|join| ?X ?Y) ?Z)).
% 0.20/0.49 ; Recognized associativity assertion (= (|composition| ?X (|composition| ?Y ?Z)) (|composition| (|composition| ?X ?Y) ?Z)).
% 0.20/0.49 ; Recognized right identity assertion (= (|composition| ?X |one|) ?X).
% 0.20/0.49 ; Recognized possible right inverse assertion (= |top| (|join| ?X (|complement| ?X))).
% 0.20/0.49 ; Recognized possible right inverse assertion (= |zero| (|meet| ?X (|complement| ?X))).
% 0.20/0.49 ; Declaring join to be commutative.
% 16.64/16.80 ; Declaring join to be associative-commutative.
% 16.64/16.80
% 16.64/16.80 #||
% 16.64/16.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.64/16.80 % SZS output start Refutation
% See solution above
% 16.64/16.80 ||#
% 16.64/16.80
% 16.64/16.80 ; Summary of computation:
% 16.64/16.80 ; 16224 formulas have been input or derived (from 158 formulas).
% 16.64/16.80 ; 3639 (22%) were retained. Of these,
% 16.64/16.80 ; 1054 (29%) were simplified or subsumed later,
% 16.64/16.80 ; 2585 (71%) are still being kept.
% 16.64/16.80 ;
% 16.64/16.80 ; Run time in seconds excluding printing time:
% 16.64/16.80 ; 0.004 0% Read assertion file (1 call)
% 16.64/16.80 ; 0.001 0% Assert (14 calls)
% 16.64/16.80 ; 0.620 4% Process new row (15,866 calls)
% 16.64/16.80 ; 0.010 0% Resolution (314 calls)
% 16.64/16.80 ; 0.321 2% Paramodulation (157 calls)
% 16.64/16.80 ; 0.013 0% Embedding (1,319 calls)
% 16.64/16.80 ; 8.267 51% Forward simplification (13,955 calls)
% 16.64/16.80 ; 0.255 2% Backward simplification (2,346 calls)
% 16.64/16.80 ; 0.287 2% Ordering (62,246 calls)
% 16.64/16.80 ; 6.473 40% Ordering ac (23,757 calls)
% 16.64/16.80 ; 0.000 0% Sortal reasoning (32 calls)
% 16.64/16.80 ; 0.000 0% Purity testing (1 call)
% 16.64/16.80 ; 0.072 0% Other
% 16.64/16.80 ; 16.323 Total
% 16.64/16.80 ; 16.326 Real time
% 16.64/16.81 ;
% 16.64/16.81 ; Term-hash-array has 11,062 terms in all.
% 16.64/16.81 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 16.64/16.81 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 16.64/16.81 ; Path-index has 7,920 entries (8,757 at peak, 11,219 added, 3,299 deleted).
% 16.64/16.81 ; Path-index has 6,528 nodes (6,691 at peak, 7,407 added, 879 deleted).
% 16.64/16.81 ; Trie-index has 7,920 entries (8,757 at peak, 11,219 added, 3,299 deleted).
% 16.64/16.81 ; Trie-index has 9,099 nodes (9,139 at peak, 10,095 added, 996 deleted).
% 16.64/16.81 ; Retrieved 25,607,539 generalization terms in 133,376 calls.
% 16.64/16.81 ; Retrieved 18,195 instance terms in 3,611 calls.
% 16.64/16.81 ; Retrieved 95,800 unifiable terms in 1,018 calls.
% 16.64/16.81 ;
% 16.64/16.81 ; The agenda of rows to process has 3 entries:
% 16.64/16.81 ; 3 with value 24
% 16.64/16.81 ; The agenda of rows to give has 2474 entries:
% 16.64/16.81 ; 1 with value (4 17) 145 with value (4 29) 9 with value (4 40)
% 16.64/16.81 ; 2 with value (4 19) 273 with value (4 30) 14 with value (4 41)
% 16.64/16.81 ; 52 with value (4 20) 233 with value (4 31) 5 with value (4 42)
% 16.64/16.81 ; 77 with value (4 21) 98 with value (4 32) 3 with value (4 43)
% 16.64/16.81 ; 99 with value (4 22) 63 with value (4 33) 6 with value (4 44)
% 16.64/16.81 ; 139 with value (4 23) 60 with value (4 34) 8 with value (4 45)
% 16.64/16.81 ; 123 with value (4 24) 52 with value (4 35) 1 with value (4 46)
% 16.64/16.81 ; 212 with value (4 25) 21 with value (4 36) 2 with value (4 47)
% 16.64/16.81 ; 232 with value (4 26) 26 with value (4 37) 2 with value (4 48)
% 16.64/16.81 ; 233 with value (4 27) 20 with value (4 38) 2 with value (4 49)
% 16.64/16.81 ; 232 with value (4 28) 29 with value (4 39)
% 16.64/16.81 Evaluation took:
% 16.64/16.81 16.327 seconds of real time
% 16.64/16.81 16.104362 seconds of user run time
% 16.64/16.81 0.22294 seconds of system run time
% 16.64/16.81 [Run times include 0.314 seconds GC run time.]
% 16.64/16.81 0 calls to %EVAL
% 16.64/16.81 0 page faults and
% 16.64/16.81 422,976,384 bytes consed.
% 16.64/16.81 :PROOF-FOUND
% 16.64/16.81 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-08T11:42:11
% 16.64/16.81 :PROOF-FOUND
% 16.64/16.81 *
%------------------------------------------------------------------------------