TSTP Solution File: SWC090+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWC090+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n006.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 : Tue Jul 19 21:56:50 EDT 2022
% Result : Theorem 10.63s 10.83s
% Output : Refutation 10.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 34 ( 27 unt; 2 nHn; 34 RR)
% Number of literals : 49 ( 16 equ; 16 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(82,axiom,
( ~ ssList(X)
| ~ ssList(Y)
| neq(X,Y)
| X = Y ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
cnf(84,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
cnf(98,axiom,
( ~ ssList(X)
| app(nil,X) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
cnf(135,axiom,
( ~ ssList(X)
| segmentP(X,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
cnf(136,axiom,
( ~ ssList(X)
| ~ ssList(Y)
| ~ ssList(Z)
| ~ ssList(U)
| ~ segmentP(X,Y)
| segmentP(app(app(Z,X),U),Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
cnf(175,axiom,
( ~ ssList(X)
| app(X,nil) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
cnf(188,negated_conjecture,
ssList('SKOLEMAAAW48'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(189,negated_conjecture,
ssList('SKOLEMAAAW49'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(192,negated_conjecture,
'SKOLEMAAAW49' = 'SKOLEMAAAW51',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(193,negated_conjecture,
'SKOLEMAAAW48' = 'SKOLEMAAAW50',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(194,negated_conjecture,
neq('SKOLEMAAAW49',nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(195,negated_conjecture,
( ~ ssList(X)
| ~ neq(X,nil)
| ~ segmentP('SKOLEMAAAW49',X)
| ~ segmentP('SKOLEMAAAW48',X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(196,negated_conjecture,
ssList('SKOLEMAAAW52'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(197,negated_conjecture,
ssList('SKOLEMAAAW53'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(198,negated_conjecture,
app('SKOLEMAAAW52','SKOLEMAAAW53') = 'SKOLEMAAAW51',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(199,plain,
app('SKOLEMAAAW52','SKOLEMAAAW53') = 'SKOLEMAAAW49',
inference('REWRITE',[status(thm)],[198,192,theory(equality)]) ).
cnf(200,negated_conjecture,
app('SKOLEMAAAW53','SKOLEMAAAW52') = 'SKOLEMAAAW50',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
cnf(201,plain,
app('SKOLEMAAAW53','SKOLEMAAAW52') = 'SKOLEMAAAW48',
inference('REWRITE',[status(thm)],[200,193,theory(equality)]) ).
cnf(224,plain,
segmentP('SKOLEMAAAW53','SKOLEMAAAW53'),
inference('HYPERRESOLVE',[status(thm)],[135,197]) ).
cnf(225,plain,
segmentP('SKOLEMAAAW52','SKOLEMAAAW52'),
inference('HYPERRESOLVE',[status(thm)],[135,196]) ).
cnf(226,plain,
segmentP('SKOLEMAAAW49','SKOLEMAAAW49'),
inference('HYPERRESOLVE',[status(thm)],[135,189]) ).
cnf(251,plain,
app(nil,'SKOLEMAAAW53') = 'SKOLEMAAAW53',
inference('HYPERRESOLVE',[status(thm)],[98,197]) ).
cnf(257,plain,
app('SKOLEMAAAW52',nil) = 'SKOLEMAAAW52',
inference('HYPERRESOLVE',[status(thm)],[175,196]) ).
cnf(258,plain,
app('SKOLEMAAAW49',nil) = 'SKOLEMAAAW49',
inference('HYPERRESOLVE',[status(thm)],[175,189]) ).
cnf(259,plain,
app('SKOLEMAAAW48',nil) = 'SKOLEMAAAW48',
inference('HYPERRESOLVE',[status(thm)],[175,188]) ).
cnf(493,plain,
( neq('SKOLEMAAAW53',nil)
| nil = 'SKOLEMAAAW53' ),
inference('HYPERRESOLVE',[status(thm)],[82,197,84]) ).
cnf(1375,plain,
segmentP('SKOLEMAAAW49','SKOLEMAAAW53'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[136,224,197,197,196,84]),258,199,theory(equality)]) ).
cnf(1384,plain,
segmentP('SKOLEMAAAW48','SKOLEMAAAW53'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[136,224,197,197,84,196]),201,251,theory(equality)]) ).
cnf(1392,plain,
segmentP('SKOLEMAAAW48','SKOLEMAAAW52'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[136,225,196,196,197,84]),259,201,theory(equality)]) ).
cnf(1408,plain,
~ segmentP('SKOLEMAAAW48','SKOLEMAAAW49'),
inference('UR-RESOLVE',[status(thm)],[195,226,189,194]) ).
cnf(3477,plain,
~ neq('SKOLEMAAAW53',nil),
inference('UR-RESOLVE',[status(thm)],[195,1384,197,1375]) ).
cnf(3478,plain,
nil = 'SKOLEMAAAW53',
inference('REWRITE',[status(thm)],[493,3477]) ).
cnf(3479,plain,
'SKOLEMAAAW52' = 'SKOLEMAAAW49',
inference('REWRITE',[status(thm)],[199,257,3478,theory(equality)]) ).
cnf(3547,plain,
$false,
inference('REWRITE',[status(thm)],[1392,1408,3479,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC090+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n006.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 11 22:27:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 *
% 0.19/0.48 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-11T22:27:12
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-06-11T22:27:12
% 10.63/10.83
% 10.63/10.83
% 10.63/10.83 #||
% 10.63/10.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.63/10.83 % SZS output start Refutation
% See solution above
% 10.63/10.83 ||#
% 10.63/10.83
% 10.63/10.83 ; Summary of computation:
% 10.63/10.83 ; 11975 formulas have been input or derived (from 256 formulas).
% 10.63/10.83 ; 3547 (30%) were retained. Of these,
% 10.63/10.83 ; 2486 (70%) were simplified or subsumed later,
% 10.63/10.83 ; 1061 (30%) are still being kept.
% 10.63/10.83 ;
% 10.63/10.83 ; Run time in seconds excluding printing time:
% 10.63/10.83 ; 0.028 0% Read assertion file (1 call)
% 10.63/10.83 ; 0.007 0% Assert (96 calls)
% 10.63/10.83 ; 0.216 2% Process new row (10,387 calls)
% 10.63/10.83 ; 9.708 94% Resolution (510 calls)
% 10.63/10.83 ; 0.004 0% Paramodulation (255 calls)
% 10.63/10.83 ; 0.008 0% Condensing (761 calls)
% 10.63/10.83 ; 0.010 0% Forward subsumption (761 calls)
% 10.63/10.83 ; 0.010 0% Backward subsumption (623 calls)
% 10.63/10.83 ; 0.000 0% Clause clause subsumption (288 calls)
% 10.63/10.83 ; 0.163 2% Forward simplification (10,042 calls)
% 10.63/10.83 ; 0.133 1% Backward simplification (3,545 calls)
% 10.63/10.83 ; 0.004 0% Ordering (1,326 calls)
% 10.63/10.83 ; 0.000 0% Sortal reasoning (32 calls)
% 10.63/10.83 ; 0.001 0% Purity testing (1 call)
% 10.63/10.83 ; 0.058 1% Other
% 10.63/10.83 ; 10.350 Total
% 10.63/10.83 ; 10.351 Real time
% 10.63/10.83 ;
% 10.63/10.83 ; Term-hash-array has 6,331 terms in all.
% 10.63/10.83 ; Feature-vector-row-index has 337 entries (529 at peak, 623 added, 286 deleted).
% 10.63/10.83 ; Feature-vector-row-index has 1,430 nodes (2,382 at peak, 2,920 added, 1,490 deleted).
% 10.63/10.83 ; Retrieved 409 possibly forward subsuming rows in 761 calls.
% 10.63/10.83 ; Retrieved 153 possibly backward subsumed rows in 623 calls.
% 10.63/10.83 ; Path-index has 1,946 entries (4,639 at peak, 6,425 added, 4,479 deleted).
% 10.63/10.83 ; Path-index has 2,810 nodes (3,529 at peak, 3,944 added, 1,134 deleted).
% 10.63/10.83 ; Trie-index has 1,946 entries (4,639 at peak, 6,425 added, 4,479 deleted).
% 10.63/10.83 ; Trie-index has 6,222 nodes (13,392 at peak, 18,498 added, 12,276 deleted).
% 10.63/10.83 ; Retrieved 15,670 generalization terms in 56,145 calls.
% 10.63/10.83 ; Retrieved 2,970 instance terms in 2,921 calls.
% 10.63/10.83 ; Retrieved 27,797,959 unifiable terms in 540,074 calls.
% 10.63/10.83 ;
% 10.63/10.83 ; The agenda of backward simplifiable rows to process has 985 entries:
% 10.63/10.83 ; 985 with value 0
% 10.63/10.83 ; The agenda of rows to process has 79 entries:
% 10.63/10.83 ; 3 with value 7 10 with value 14 1 with value 16
% 10.63/10.83 ; 4 with value 9 10 with value 15 1 with value 18
% 10.63/10.83 ; 50 with value 13
% 10.63/10.83 ; The agenda of input rows to give has 1 entry:
% 10.63/10.83 ; 1 with value 4
% 10.63/10.83 ; The agenda of rows to give has 830 entries:
% 10.63/10.83 ; 5 with value (4 5) 57 with value (4 13) 51 with value (4 21)
% 10.63/10.83 ; 8 with value (4 6) 65 with value (4 14) 21 with value (4 22)
% 10.63/10.83 ; 19 with value (4 7) 54 with value (4 15) 45 with value (4 23)
% 10.63/10.83 ; 41 with value (4 8) 32 with value (4 16) 22 with value (4 24)
% 10.63/10.83 ; 110 with value (4 9) 57 with value (4 17) 26 with value (4 25)
% 10.63/10.83 ; 23 with value (4 10) 33 with value (4 18) 5 with value (4 26)
% 10.63/10.83 ; 45 with value (4 11) 38 with value (4 19) 1 with value (4 31)
% 10.63/10.83 ; 38 with value (4 12) 28 with value (4 20) 6 with value (4 35)
% 10.63/10.83 Evaluation took:
% 10.63/10.83 10.351 seconds of real time
% 10.63/10.83 10.191124 seconds of user run time
% 10.63/10.83 0.160924 seconds of system run time
% 10.63/10.83 [Run times include 0.502 seconds GC run time.]
% 10.63/10.83 0 calls to %EVAL
% 10.63/10.83 0 page faults and
% 10.63/10.83 1,079,115,064 bytes consed.
% 10.63/10.83 :PROOF-FOUND
% 10.63/10.83 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-11T22:27:22
% 10.63/10.83 :PROOF-FOUND
% 10.63/10.83 *
%------------------------------------------------------------------------------