TSTP Solution File: REL023+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : REL023+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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:31 EDT 2022
% Result : Theorem 0.82s 1.01s
% Output : Refutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 4 RR)
% Number of literals : 26 ( 25 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 7 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(6,axiom,
composition(join(X,Y),Z) = join(composition(X,Z),composition(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
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,
join(composition(meet('SKOLEMAAAV1',converse('SKOLEMAAAV2')),meet('SKOLEMAAAV2','SKOLEMAAAV3')),composition('SKOLEMAAAV1',meet('SKOLEMAAAV2','SKOLEMAAAV3'))) != composition('SKOLEMAAAV1',meet('SKOLEMAAAV2','SKOLEMAAAV3')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(19,plain,
composition(join(complement(join(complement('SKOLEMAAAV1'),complement(converse('SKOLEMAAAV2')))),'SKOLEMAAAV1'),complement(join(complement('SKOLEMAAAV2'),complement('SKOLEMAAAV3')))) != composition('SKOLEMAAAV1',complement(join(complement('SKOLEMAAAV2'),complement('SKOLEMAAAV3')))),
inference('REWRITE',[status(thm)],[18,6,3,theory(equality)]) ).
cnf(26,plain,
join(top,X) = join(top,complement(join(Y,complement(join(X,Y))))),
inference('PARAMODULATE',[status(thm)],[15,15,theory(equality)]) ).
cnf(66,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,
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(80,plain,
X = complement(complement(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,14,theory(equality)]),78,17,theory(equality)]) ).
cnf(83,plain,
X = join(complement(join(complement(X),complement(join(X,Y)))),complement(join(top,Y))),
inference('PARAMODULATE',[status(thm)],[1,15,theory(equality)]) ).
cnf(85,plain,
X = join(complement(join(top,complement(X))),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,12,theory(equality)]),80,66,theory(equality)]) ).
cnf(101,plain,
join(top,complement(X)) = join(top,complement(join(complement(Y),X))),
inference('PARAMODULATE',[status(thm)],[15,2,theory(equality)]) ).
cnf(103,plain,
join(top,X) = join(top,complement(Y)),
inference('REWRITE',[status(thm)],[26,101,theory(equality)]) ).
cnf(124,plain,
top = join(top,X),
inference('PARAMODULATE',[status(thm)],[14,103,theory(equality)]) ).
cnf(144,plain,
X = join(zero,X),
inference('REWRITE',[status(thm)],[85,17,124,theory(equality)]) ).
cnf(149,plain,
X = complement(join(complement(X),complement(join(X,Y)))),
inference('REWRITE',[status(thm)],[83,144,17,124,theory(equality)]) ).
cnf(340,plain,
join(complement(X),complement(join(X,Y))) = complement(X),
inference('PARAMODULATE',[status(thm)],[80,149,theory(equality)]) ).
cnf(379,plain,
join(X,complement(join(complement(X),Y))) = X,
inference('PARAMODULATE',[status(thm)],[340,80,theory(equality)]) ).
cnf(381,plain,
$false,
inference('REWRITE',[status(thm)],[19,379,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL023+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 8 09:17:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-08T09:17:23
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-08T09:17:23
% 0.20/0.50
% 0.20/0.50 ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.20/0.50 ; Recognized associativity assertion (= (|join| ?X (|join| ?Y ?Z)) (|join| (|join| ?X ?Y) ?Z)).
% 0.20/0.50 ; Recognized associativity assertion (= (|composition| ?X (|composition| ?Y ?Z)) (|composition| (|composition| ?X ?Y) ?Z)).
% 0.20/0.50 ; Recognized right identity assertion (= (|composition| ?X |one|) ?X).
% 0.20/0.50 ; Recognized possible right inverse assertion (= |top| (|join| ?X (|complement| ?X))).
% 0.20/0.50 ; Recognized possible right inverse assertion (= |zero| (|meet| ?X (|complement| ?X))).
% 0.20/0.50 ; Declaring join to be commutative.
% 0.82/1.01 ; Declaring join to be associative-commutative.
% 0.82/1.01
% 0.82/1.01 #||
% 0.82/1.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/1.01 % SZS output start Refutation
% See solution above
% 0.82/1.01 ||#
% 0.82/1.01
% 0.82/1.01 ; Summary of computation:
% 0.82/1.01 ; 2042 formulas have been input or derived (from 60 formulas).
% 0.82/1.01 ; 381 (19%) were retained. Of these,
% 0.82/1.01 ; 109 (29%) were simplified or subsumed later,
% 0.82/1.01 ; 272 (71%) are still being kept.
% 0.82/1.01 ;
% 0.82/1.01 ; Run time in seconds excluding printing time:
% 0.82/1.01 ; 0.003 1% Read assertion file (1 call)
% 0.82/1.01 ; 0.001 0% Assert (14 calls)
% 0.82/1.01 ; 0.034 7% Process new row (1,829 calls)
% 0.82/1.01 ; 0.003 1% Resolution (118 calls)
% 0.82/1.01 ; 0.050 10% Paramodulation (59 calls)
% 0.82/1.01 ; 0.000 0% Embedding (145 calls)
% 0.82/1.01 ; 0.144 28% Forward simplification (1,357 calls)
% 0.82/1.01 ; 0.018 3% Backward simplification (238 calls)
% 0.82/1.01 ; 0.018 3% Ordering (5,141 calls)
% 0.82/1.01 ; 0.214 41% Ordering ac (3,272 calls)
% 0.82/1.01 ; 0.000 0% Sortal reasoning (32 calls)
% 0.82/1.01 ; 0.000 0% Purity testing (1 call)
% 0.82/1.01 ; 0.036 7% Other
% 0.82/1.01 ; 0.521 Total
% 0.82/1.01 ; 0.524 Real time
% 0.82/1.01 ;
% 0.82/1.01 ; Term-hash-array has 1,197 terms in all.
% 0.82/1.01 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.82/1.01 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.82/1.01 ; Path-index has 939 entries (950 at peak, 1,273 added, 334 deleted).
% 0.82/1.01 ; Path-index has 1,260 nodes (1,288 at peak, 1,380 added, 120 deleted).
% 0.82/1.01 ; Trie-index has 939 entries (950 at peak, 1,273 added, 334 deleted).
% 0.82/1.01 ; Trie-index has 981 nodes (994 at peak, 1,107 added, 126 deleted).
% 0.82/1.01 ; Retrieved 195,022 generalization terms in 11,740 calls.
% 0.82/1.01 ; Retrieved 1,145 instance terms in 332 calls.
% 0.82/1.01 ; Retrieved 6,596 unifiable terms in 357 calls.
% 0.82/1.01 ;
% 0.82/1.01 ; The agenda of rows to process has 183 entries:
% 0.82/1.01 ; 13 with value 17 7 with value 26 2 with value 34
% 0.82/1.01 ; 4 with value 18 14 with value 27 3 with value 35
% 0.82/1.01 ; 10 with value 19 8 with value 28 5 with value 36
% 0.82/1.01 ; 3 with value 20 5 with value 29 3 with value 37
% 0.82/1.01 ; 23 with value 21 17 with value 30 4 with value 39
% 0.82/1.01 ; 7 with value 22 5 with value 31 1 with value 40
% 0.82/1.01 ; 13 with value 23 4 with value 32 1 with value 41
% 0.82/1.01 ; 15 with value 24 8 with value 33 1 with value 45
% 0.82/1.01 ; 7 with value 25
% 0.82/1.01 ; The agenda of rows to give has 226 entries:
% 0.82/1.01 ; 4 with value (4 16) 17 with value (4 23) 3 with value (4 29)
% 0.82/1.01 ; 16 with value (4 17) 23 with value (4 24) 1 with value (4 30)
% 0.82/1.01 ; 10 with value (4 18) 11 with value (4 25) 4 with value (4 31)
% 0.82/1.01 ; 7 with value (4 19) 8 with value (4 26) 3 with value (4 32)
% 0.82/1.01 ; 21 with value (4 20) 11 with value (4 27) 2 with value (4 36)
% 0.82/1.01 ; 22 with value (4 21) 7 with value (4 28) 2 with value (4 37)
% 0.82/1.01 ; 54 with value (4 22)
% 0.82/1.01 Evaluation took:
% 0.82/1.01 0.524 seconds of real time
% 0.82/1.01 0.493481 seconds of user run time
% 0.82/1.01 0.03014 seconds of system run time
% 0.82/1.01 [Run times include 0.011 seconds GC run time.]
% 0.82/1.01 0 calls to %EVAL
% 0.82/1.01 0 page faults and
% 0.82/1.01 27,812,008 bytes consed.
% 0.82/1.01 :PROOF-FOUND
% 0.82/1.01 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-08T09:17:24
% 0.82/1.01 :PROOF-FOUND
% 0.82/1.01 *
%------------------------------------------------------------------------------