TSTP Solution File: PRO014+2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n019.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 17:53:22 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 26 ( 15 unt; 7 nHn; 26 RR)
% Number of literals : 63 ( 0 equ; 33 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ min_precedes(X,Y,Z)
| ~ min_precedes(Y,U,Z)
| min_precedes(X,U,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
cnf(5,axiom,
( ~ next_subocc(X,Y,Z)
| min_precedes(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
cnf(64,axiom,
( ~ occurrence_of(X,tptp0)
| ~ subactivity_occurrence(Y,X)
| ~ arboreal(Y)
| leaf_occ(Y,X)
| occurrence_of('SKOLEMAAAV15'(Y),tptp3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
cnf(65,axiom,
( ~ occurrence_of(X,tptp0)
| ~ subactivity_occurrence(Y,X)
| ~ arboreal(Y)
| leaf_occ(Y,X)
| next_subocc(Y,'SKOLEMAAAV15'(Y),tptp0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
cnf(67,axiom,
( ~ occurrence_of(X,tptp0)
| ~ subactivity_occurrence(Y,X)
| ~ arboreal(Y)
| leaf_occ(Y,X)
| next_subocc('SKOLEMAAAV15'(Y),'SKOLEMAAAV16'(Y),tptp0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
cnf(68,axiom,
( ~ occurrence_of(X,tptp0)
| ~ subactivity_occurrence(Y,X)
| ~ arboreal(Y)
| leaf_occ(Y,X)
| occurrence_of('SKOLEMAAAV17'(Y),tptp2)
| occurrence_of('SKOLEMAAAV17'(Y),tptp1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
cnf(69,axiom,
( ~ occurrence_of(X,tptp0)
| ~ subactivity_occurrence(Y,X)
| ~ arboreal(Y)
| leaf_occ(Y,X)
| next_subocc('SKOLEMAAAV16'(Y),'SKOLEMAAAV17'(Y),tptp0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
cnf(70,axiom,
( ~ occurrence_of(X,tptp0)
| ~ subactivity_occurrence(Y,X)
| ~ arboreal(Y)
| leaf_occ(Y,X)
| leaf('SKOLEMAAAV17'(Y),tptp0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
cnf(83,negated_conjecture,
occurrence_of('SKOLEMAAAV19',tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(84,negated_conjecture,
subactivity_occurrence('SKOLEMAAAV18','SKOLEMAAAV19'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(85,negated_conjecture,
arboreal('SKOLEMAAAV18'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(86,negated_conjecture,
~ leaf_occ('SKOLEMAAAV18','SKOLEMAAAV19'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(87,negated_conjecture,
( ~ occurrence_of(X,tptp3)
| ~ next_subocc('SKOLEMAAAV18',X,tptp0)
| ~ occurrence_of(Y,tptp2)
| ~ min_precedes(X,Y,tptp0)
| ~ leaf(Y,tptp0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(88,negated_conjecture,
( ~ occurrence_of(X,tptp3)
| ~ next_subocc('SKOLEMAAAV18',X,tptp0)
| ~ occurrence_of(Y,tptp1)
| ~ min_precedes(X,Y,tptp0)
| ~ leaf(Y,tptp0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(97,plain,
occurrence_of('SKOLEMAAAV15'('SKOLEMAAAV18'),tptp3),
inference('UR-RESOLVE',[status(thm)],[64,83,84,85,86]) ).
cnf(99,plain,
leaf('SKOLEMAAAV17'('SKOLEMAAAV18'),tptp0),
inference('UR-RESOLVE',[status(thm)],[70,83,84,85,86]) ).
cnf(100,plain,
next_subocc('SKOLEMAAAV18','SKOLEMAAAV15'('SKOLEMAAAV18'),tptp0),
inference('UR-RESOLVE',[status(thm)],[65,83,84,85,86]) ).
cnf(101,plain,
next_subocc('SKOLEMAAAV15'('SKOLEMAAAV18'),'SKOLEMAAAV16'('SKOLEMAAAV18'),tptp0),
inference('UR-RESOLVE',[status(thm)],[67,83,84,85,86]) ).
cnf(102,plain,
next_subocc('SKOLEMAAAV16'('SKOLEMAAAV18'),'SKOLEMAAAV17'('SKOLEMAAAV18'),tptp0),
inference('UR-RESOLVE',[status(thm)],[69,83,84,85,86]) ).
cnf(103,plain,
( occurrence_of('SKOLEMAAAV17'('SKOLEMAAAV18'),tptp2)
| occurrence_of('SKOLEMAAAV17'('SKOLEMAAAV18'),tptp1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[68,83,84,85]),86]) ).
cnf(164,plain,
min_precedes('SKOLEMAAAV15'('SKOLEMAAAV18'),'SKOLEMAAAV16'('SKOLEMAAAV18'),tptp0),
inference('HYPERRESOLVE',[status(thm)],[5,101]) ).
cnf(166,plain,
min_precedes('SKOLEMAAAV16'('SKOLEMAAAV18'),'SKOLEMAAAV17'('SKOLEMAAAV18'),tptp0),
inference('HYPERRESOLVE',[status(thm)],[5,102]) ).
cnf(235,plain,
min_precedes('SKOLEMAAAV15'('SKOLEMAAAV18'),'SKOLEMAAAV17'('SKOLEMAAAV18'),tptp0),
inference('HYPERRESOLVE',[status(thm)],[1,166,164]) ).
cnf(299,plain,
~ occurrence_of('SKOLEMAAAV17'('SKOLEMAAAV18'),tptp1),
inference('UR-RESOLVE',[status(thm)],[88,235,97,100,99]) ).
cnf(300,plain,
occurrence_of('SKOLEMAAAV17'('SKOLEMAAAV18'),tptp2),
inference('REWRITE',[status(thm)],[103,299]) ).
cnf(301,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[87,235,97,100,99]),300]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n019.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 : Mon Jun 13 01:13:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 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-13T01:13:10
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-06-13T01:13:10
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 #||
% 0.20/0.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.56 % SZS output start Refutation
% See solution above
% 0.20/0.57 ||#
% 0.20/0.57
% 0.20/0.57 ; Summary of computation:
% 0.20/0.57 ; 632 formulas have been input or derived (from 191 formulas).
% 0.20/0.57 ; 301 (48%) were retained. Of these,
% 0.20/0.57 ; 8 ( 3%) were simplified or subsumed later,
% 0.20/0.57 ; 293 (97%) are still being kept.
% 0.20/0.57 ;
% 0.20/0.57 ; Run time in seconds excluding printing time:
% 0.20/0.57 ; 0.011 12% Read assertion file (1 call)
% 0.20/0.57 ; 0.003 3% Assert (46 calls)
% 0.20/0.57 ; 0.019 20% Process new row (493 calls)
% 0.20/0.57 ; 0.024 26% Resolution (380 calls)
% 0.20/0.57 ; 0.001 1% Paramodulation (190 calls)
% 0.20/0.57 ; 0.001 1% Condensing (86 calls)
% 0.20/0.57 ; 0.001 1% Forward subsumption (86 calls)
% 0.20/0.57 ; 0.000 0% Backward subsumption (86 calls)
% 0.20/0.57 ; 0.000 0% Clause clause subsumption (13 calls)
% 0.20/0.57 ; 0.005 5% Forward simplification (487 calls)
% 0.20/0.57 ; 0.002 2% Backward simplification (301 calls)
% 0.20/0.57 ; 0.000 0% Ordering (21 calls)
% 0.20/0.57 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.57 ; 0.000 0% Purity testing (1 call)
% 0.20/0.57 ; 0.027 29% Other
% 0.20/0.57 ; 0.094 Total
% 0.20/0.57 ; 0.097 Real time
% 0.20/0.57 ;
% 0.20/0.57 ; Term-hash-array has 379 terms in all.
% 0.20/0.57 ; Feature-vector-row-index has 82 entries (84 at peak, 86 added, 4 deleted).
% 0.20/0.57 ; Feature-vector-row-index has 283 nodes (303 at peak, 323 added, 40 deleted).
% 0.20/0.57 ; Retrieved 16 possibly forward subsuming rows in 86 calls.
% 0.20/0.57 ; Retrieved 7 possibly backward subsumed rows in 86 calls.
% 0.20/0.57 ; Path-index has 382 entries (382 at peak, 393 added, 11 deleted).
% 0.20/0.57 ; Path-index has 1,010 nodes (1,010 at peak, 1,023 added, 13 deleted).
% 0.20/0.57 ; Trie-index has 382 entries (382 at peak, 393 added, 11 deleted).
% 0.20/0.57 ; Trie-index has 1,089 nodes (1,089 at peak, 1,122 added, 33 deleted).
% 0.20/0.57 ; Retrieved 198 generalization terms in 449 calls.
% 0.20/0.57 ; Retrieved 214 instance terms in 214 calls.
% 0.20/0.57 ; Retrieved 12,399 unifiable terms in 4,012 calls.
% 0.20/0.57 ;
% 0.20/0.57 ; The agenda of rows to process has 33 entries:
% 0.20/0.57 ; 5 with value 11 4 with value 14 1 with value 21
% 0.20/0.57 ; 6 with value 12 6 with value 15 2 with value 25
% 0.20/0.57 ; 1 with value 13 8 with value 16
% 0.20/0.57 ; The agenda of rows to give has 104 entries:
% 0.20/0.57 ; 1 with value (4 7) 22 with value (4 14) 3 with value (4 20)
% 0.20/0.57 ; 1 with value (4 10) 18 with value (4 15) 1 with value (4 22)
% 0.20/0.57 ; 15 with value (4 11) 3 with value (4 16) 2 with value (4 23)
% 0.20/0.57 ; 11 with value (4 12) 2 with value (4 18) 2 with value (4 24)
% 0.20/0.57 ; 21 with value (4 13) 1 with value (4 19) 1 with value (4 29)
% 0.20/0.57 Evaluation took:
% 0.20/0.57 0.097 seconds of real time
% 0.20/0.57 0.08783 seconds of user run time
% 0.20/0.57 0.009322 seconds of system run time
% 0.20/0.57 0 calls to %EVAL
% 0.20/0.57 0 page faults and
% 0.20/0.57 6,759,880 bytes consed.
% 0.20/0.57 :PROOF-FOUND
% 0.20/0.57 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T01:13:10
% 0.20/0.57 :PROOF-FOUND
% 0.20/0.57 *
%------------------------------------------------------------------------------