TSTP Solution File: REL048-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : REL048-1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 20:00:07 EDT 2022
% Result : Unsatisfiable 0.48s 0.70s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 27 unt; 0 nHn; 6 RR)
% Number of literals : 29 ( 28 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 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 : 35 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
X = join(complement(join(complement(X),complement(Y))),complement(join(complement(X),Y))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(2,plain,
join(complement(join(complement(X),complement(Y))),join(complement(join(complement(X),Y)),Z)) = join(X,Z),
inference('EMBED',[status(thm)],[maddux3_a_kind_of_de_Morgan_3]) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X,Y) = complement(join(complement(X),complement(Y))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X),complement(composition(X,Y))),complement(Y)) = complement(Y),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(13,plain,
join(composition(converse(X),complement(composition(X,Y))),join(complement(Y),Z)) = join(complement(Y),Z),
inference('EMBED',[status(thm)],[converse_cancellativity_11]) ).
cnf(def_top_12,axiom,
top = join(X,complement(X)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(15,plain,
join(X,join(complement(X),Y)) = join(top,Y),
inference('EMBED',[status(thm)],[def_top_12]) ).
cnf(def_zero_13,axiom,
zero = meet(X,complement(X)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(17,plain,
zero = complement(top),
inference('REWRITE',[status(thm)],[def_zero_13,maddux4_definiton_of_meet_4,theory(equality)]) ).
cnf(goals_14,negated_conjecture,
join(sk1,join(sk2,sk3)) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
cnf(19,plain,
join(sk1,join(sk2,join(sk3,X))) = join(sk3,X),
inference('EMBED',[status(thm)],[goals_14]) ).
cnf(goals_15,negated_conjecture,
( join(sk1,sk3) != sk3
| join(sk2,sk3) != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).
cnf(27,plain,
join(top,X) = join(top,complement(join(Y,complement(join(X,Y))))),
inference('PARAMODULATE',[status(thm)],[15,15,theory(equality)]) ).
cnf(89,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(101,plain,
complement(X) = join(zero,complement(join(complement(complement(X)),X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,def_top_12,theory(equality)]),17,theory(equality)]) ).
cnf(103,plain,
X = complement(complement(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,def_top_12,theory(equality)]),101,17,theory(equality)]) ).
cnf(104,plain,
complement(X) = join(zero,complement(join(X,X))),
inference('REWRITE',[status(thm)],[101,103,theory(equality)]) ).
cnf(108,plain,
X = join(complement(join(top,complement(X))),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,converse_cancellativity_11,theory(equality)]),103,89,theory(equality)]) ).
cnf(124,plain,
join(top,complement(X)) = join(top,complement(join(complement(Y),X))),
inference('PARAMODULATE',[status(thm)],[15,2,theory(equality)]) ).
cnf(126,plain,
join(top,X) = join(top,complement(Y)),
inference('REWRITE',[status(thm)],[27,124,theory(equality)]) ).
cnf(157,plain,
top = join(top,X),
inference('PARAMODULATE',[status(thm)],[def_top_12,126,theory(equality)]) ).
cnf(197,plain,
X = join(zero,X),
inference('REWRITE',[status(thm)],[108,17,157,theory(equality)]) ).
cnf(200,plain,
complement(X) = complement(join(X,X)),
inference('REWRITE',[status(thm)],[104,197,theory(equality)]) ).
cnf(203,plain,
join(X,X) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[103,200,theory(equality)]),103,theory(equality)]) ).
cnf(204,plain,
join(X,join(X,Y)) = join(X,Y),
inference('EMBED',[status(thm)],[203]) ).
cnf(206,plain,
join(sk1,sk3) = sk3,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[19,204,theory(equality)]),goals_14,theory(equality)]) ).
cnf(208,plain,
join(sk2,sk3) != sk3,
inference('REWRITE',[status(thm)],[goals_15,206,theory(equality)]) ).
cnf(209,plain,
$false,
inference('REWRITE',[status(thm)],[goals_14,208,206,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : REL048-1 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.15 % Command : run-snark %s %d
% 0.16/0.37 % Computer : n005.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Fri Jul 8 08:35:22 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.22/0.51 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.52 *
% 0.22/0.52 *
% 0.22/0.53 #<PACKAGE "SNARK-USER">
% 0.22/0.53 *
% 0.22/0.53 SNARK-TPTP-OPTIONS
% 0.22/0.53 *
% 0.22/0.53 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.53 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.53 (USE-FACTORING :POS)
% 0.22/0.53 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.53 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.53 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.53 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.53 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.53 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.53 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.53 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.53 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.53 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.53 *
% 0.22/0.53 "."
% 0.22/0.53 *
% 0.22/0.53 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-08T08:35:22
% 0.22/0.53 ; 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-07-08T08:35:22
% 0.22/0.54
% 0.22/0.54 ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.22/0.54 ; Recognized associativity assertion (= (|join| ?X (|join| ?Y ?Z)) (|join| (|join| ?X ?Y) ?Z)).
% 0.22/0.54 ; Recognized associativity assertion (= (|composition| ?X (|composition| ?Y ?Z)) (|composition| (|composition| ?X ?Y) ?Z)).
% 0.22/0.54 ; Recognized right identity assertion (= (|composition| ?X |one|) ?X).
% 0.22/0.54 ; Recognized possible right inverse assertion (= |top| (|join| ?X (|complement| ?X))).
% 0.22/0.54 ; Recognized possible right inverse assertion (= |zero| (|meet| ?X (|complement| ?X))).
% 0.22/0.54 ; Declaring join to be commutative.
% 0.48/0.70 ; Declaring join to be associative-commutative.
% 0.48/0.70
% 0.48/0.70 #||
% 0.48/0.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.70 % SZS output start Refutation
% See solution above
% 0.48/0.70 ||#
% 0.48/0.70
% 0.48/0.70 ; Summary of computation:
% 0.48/0.70 ; 715 formulas have been input or derived (from 37 formulas).
% 0.48/0.70 ; 209 (29%) were retained. Of these,
% 0.48/0.70 ; 101 (48%) were simplified or subsumed later,
% 0.48/0.70 ; 108 (52%) are still being kept.
% 0.48/0.70 ;
% 0.48/0.70 ; Run time in seconds excluding printing time:
% 0.48/0.70 ; 0.003 2% Read assertion file (1 call)
% 0.48/0.70 ; 0.001 1% Assert (15 calls)
% 0.48/0.70 ; 0.025 15% Process new row (609 calls)
% 0.48/0.70 ; 0.002 1% Resolution (72 calls)
% 0.48/0.70 ; 0.021 12% Paramodulation (36 calls)
% 0.48/0.70 ; 0.001 1% Embedding (92 calls)
% 0.48/0.70 ; 0.000 0% Condensing (1 call)
% 0.48/0.70 ; 0.000 0% Forward subsumption (1 call)
% 0.48/0.70 ; 0.000 0% Backward subsumption (1 call)
% 0.48/0.70 ; 0.038 22% Forward simplification (462 calls)
% 0.48/0.70 ; 0.013 8% Backward simplification (118 calls)
% 0.48/0.70 ; 0.004 2% Ordering (1,309 calls)
% 0.48/0.70 ; 0.030 18% Ordering ac (713 calls)
% 0.48/0.70 ; 0.001 1% Sortal reasoning (32 calls)
% 0.48/0.70 ; 0.000 0% Purity testing (1 call)
% 0.48/0.70 ; 0.030 18% Other
% 0.48/0.70 ; 0.169 Total
% 0.48/0.70 ; 0.172 Real time
% 0.48/0.70 ;
% 0.48/0.70 ; Term-hash-array has 605 terms in all.
% 0.48/0.70 ; Feature-vector-row-index has 0 entries (1 at peak, 1 added, 1 deleted).
% 0.48/0.70 ; Feature-vector-row-index has 1 node (12 at peak, 12 added, 11 deleted).
% 0.48/0.70 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.48/0.70 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.48/0.70 ; Path-index has 388 entries (496 at peak, 693 added, 305 deleted).
% 0.48/0.70 ; Path-index has 630 nodes (630 at peak, 674 added, 44 deleted).
% 0.48/0.70 ; Trie-index has 388 entries (496 at peak, 693 added, 305 deleted).
% 0.48/0.70 ; Trie-index has 316 nodes (316 at peak, 329 added, 13 deleted).
% 0.48/0.70 ; Retrieved 40,978 generalization terms in 2,927 calls.
% 0.48/0.70 ; Retrieved 695 instance terms in 140 calls.
% 0.48/0.70 ; Retrieved 3,792 unifiable terms in 194 calls.
% 0.48/0.70 ;
% 0.48/0.70 ; The agenda of rows to process has 86 entries:
% 0.48/0.70 ; 10 with value 14 6 with value 22 4 with value 30
% 0.48/0.70 ; 4 with value 15 1 with value 23 1 with value 31
% 0.48/0.70 ; 11 with value 16 5 with value 24 1 with value 32
% 0.48/0.70 ; 10 with value 18 3 with value 25 1 with value 34
% 0.48/0.70 ; 2 with value 19 4 with value 26 1 with value 35
% 0.48/0.70 ; 13 with value 20 2 with value 27 1 with value 40
% 0.48/0.70 ; 5 with value 21 1 with value 29
% 0.48/0.70 ; The agenda of input rows to give has 1 entry:
% 0.48/0.70 ; 1 with value 7
% 0.48/0.70 ; The agenda of rows to give has 81 entries:
% 0.48/0.70 ; 2 with value (4 10) 15 with value (4 20) 4 with value (4 28)
% 0.48/0.70 ; 5 with value (4 13) 2 with value (4 21) 3 with value (4 29)
% 0.48/0.70 ; 1 with value (4 14) 12 with value (4 22) 2 with value (4 31)
% 0.48/0.70 ; 10 with value (4 15) 1 with value (4 23) 2 with value (4 32)
% 0.48/0.70 ; 3 with value (4 16) 2 with value (4 24) 2 with value (4 36)
% 0.48/0.70 ; 6 with value (4 17) 3 with value (4 25) 2 with value (4 37)
% 0.48/0.70 ; 2 with value (4 19) 2 with value (4 26)
% 0.48/0.70 Evaluation took:
% 0.48/0.70 0.172 seconds of real time
% 0.48/0.70 0.160306 seconds of user run time
% 0.48/0.70 0.011849 seconds of system run time
% 0.48/0.70 0 calls to %EVAL
% 0.48/0.70 0 page faults and
% 0.48/0.70 9,819,728 bytes consed.
% 0.48/0.70 :PROOF-FOUND
% 0.48/0.70 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-08T08:35:22
% 0.48/0.70 :PROOF-FOUND
% 0.48/0.70 *
%------------------------------------------------------------------------------