TSTP Solution File: COM004-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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 : Fri Jul 15 01:42:37 EDT 2022
% Result : Unsatisfiable 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of clauses : 10 ( 9 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 2 equ; 5 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 9 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(make_node,axiom,
( failure_node(parent_of(X,Y),or(Z,U))
| ~ failure_node(X,or(Z,V))
| ~ failure_node(Y,or(U,W))
| ~ contradictory(V,W)
| ~ siblings(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',make_node) ).
cnf(x_contradicts_not_x,axiom,
contradictory(X,negate(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_contradicts_not_x) ).
cnf(n_left_and_n_right_are_siblings,axiom,
siblings(left_child_of(X),right_child_of(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_left_and_n_right_are_siblings) ).
cnf(n_left_is_atom,hypothesis,
failure_node(n_left,or(empty,atom)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_left_is_atom) ).
cnf(n_right_is_not_atom,hypothesis,
failure_node(n_right,or(empty,negate(atom))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_right_is_not_atom) ).
cnf(n_left_equals_left_child_of_n,hypothesis,
n_left = left_child_of(n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_left_equals_left_child_of_n) ).
cnf(n_right_equals_right_child_of_n,hypothesis,
n_right = right_child_of(n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n_right_equals_right_child_of_n) ).
cnf(goal_is_there_an_empty_node,negated_conjecture,
~ failure_node(X,or(empty,empty)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_is_there_an_empty_node) ).
cnf(10,plain,
siblings(n_left,n_right),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[n_left_and_n_right_are_siblings,n_left_equals_left_child_of_n,theory(equality)]),n_right_equals_right_child_of_n,theory(equality)]) ).
cnf(11,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[make_node,goal_is_there_an_empty_node,n_left_is_atom,n_right_is_not_atom,x_contradicts_not_x]),10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n011.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 : Thu Jun 16 19:33:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:33:51
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-16T19:33:51
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 #||
% 0.20/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50 % SZS output start Refutation
% See solution above
% 0.20/0.50 ||#
% 0.20/0.50
% 0.20/0.50 ; Summary of computation:
% 0.20/0.50 ; 15 formulas have been input or derived (from 10 formulas).
% 0.20/0.50 ; 11 (73%) were retained. Of these,
% 0.20/0.50 ; 11 (100%) are still being kept.
% 0.20/0.50 ;
% 0.20/0.50 ; Run time in seconds excluding printing time:
% 0.20/0.50 ; 0.001 4% Read assertion file (1 call)
% 0.20/0.50 ; 0.001 4% Assert (9 calls)
% 0.20/0.50 ; 0.000 0% Process new row (14 calls)
% 0.20/0.50 ; 0.001 4% Resolution (18 calls)
% 0.20/0.50 ; 0.000 0% Paramodulation (9 calls)
% 0.20/0.50 ; 0.000 0% Condensing (1 call)
% 0.20/0.50 ; 0.000 0% Forward subsumption (1 call)
% 0.20/0.50 ; 0.000 0% Backward subsumption (1 call)
% 0.20/0.50 ; 0.001 4% Forward simplification (14 calls)
% 0.20/0.50 ; 0.000 0% Backward simplification (11 calls)
% 0.20/0.50 ; 0.000 0% Ordering (12 calls)
% 0.20/0.50 ; 0.001 4% Sortal reasoning (32 calls)
% 0.20/0.50 ; 0.000 0% Purity testing (1 call)
% 0.20/0.50 ; 0.020 80% Other
% 0.20/0.50 ; 0.025 Total
% 0.20/0.50 ; 0.027 Real time
% 0.20/0.50 ;
% 0.20/0.50 ; Term-hash-array has 27 terms in all.
% 0.20/0.50 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.20/0.50 ; Feature-vector-row-index has 9 nodes (9 at peak, 9 added, 0 deleted).
% 0.20/0.50 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.20/0.50 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.20/0.50 ; Path-index has 32 entries (32 at peak, 32 added, 0 deleted).
% 0.20/0.50 ; Path-index has 78 nodes (78 at peak, 78 added, 0 deleted).
% 0.20/0.50 ; Trie-index has 32 entries (32 at peak, 32 added, 0 deleted).
% 0.20/0.50 ; Trie-index has 72 nodes (72 at peak, 72 added, 0 deleted).
% 0.20/0.50 ; Retrieved 4 generalization terms in 10 calls.
% 0.20/0.50 ; Retrieved 9 instance terms in 9 calls.
% 0.20/0.50 ; Retrieved 90 unifiable terms in 89 calls.
% 0.20/0.50 ;
% 0.20/0.50 ; The agenda of rows to process has 1 entry:
% 0.20/0.50 ; 1 with value 5
% 0.20/0.50 ; The agenda of rows to give has 1 entry:
% 0.20/0.50 ; 1 with value (4 5)
% 0.20/0.50 Evaluation took:
% 0.20/0.50 0.028 seconds of real time
% 0.20/0.50 0.019018 seconds of user run time
% 0.20/0.50 0.008833 seconds of system run time
% 0.20/0.50 0 calls to %EVAL
% 0.20/0.50 0 page faults and
% 0.20/0.50 1,825,408 bytes consed.
% 0.20/0.50 :PROOF-FOUND
% 0.20/0.50 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:33:51
% 0.20/0.50 :PROOF-FOUND
% 0.20/0.50 *
%------------------------------------------------------------------------------