TSTP Solution File: SWW102+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWW102+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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 : Thu Jul 21 01:24:32 EDT 2022
% Result : Theorem 9.47s 9.69s
% Output : Refutation 9.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of clauses : 52 ( 32 unt; 13 nHn; 37 RR)
% Number of literals : 79 ( 60 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ bool(X)
| X = false
| X = true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_bool) ).
cnf(2,axiom,
( bool(X)
| X != false ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_bool) ).
cnf(3,axiom,
( bool(X)
| X != true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_bool) ).
cnf(4,axiom,
true != false,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',distinct_false_true_err) ).
cnf(7,axiom,
d(true),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',false_true_err_in_d) ).
cnf(8,axiom,
d(false),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',false_true_err_in_d) ).
cnf(20,axiom,
( forallprefers(X,Y)
| X != false
| Y != true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_forallprefers) ).
cnf(33,axiom,
( phi(X) = X
| ~ d(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_phi) ).
cnf(36,axiom,
( prop(X) = true
| ~ bool(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',prop_true) ).
cnf(38,axiom,
( prop(X) = false
| bool(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',prop_false) ).
cnf(39,axiom,
( bool(X)
| impl(X,Y) = phi(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',impl_axiom1) ).
cnf(41,axiom,
( ~ bool(X)
| impl(false,X) = true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',impl_axiom3) ).
cnf(42,axiom,
( ~ bool(X)
| impl(true,X) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',impl_axiom4) ).
cnf(44,axiom,
lazy_impl(false,X) = true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
cnf(45,axiom,
lazy_impl(true,X) = phi(X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom3) ).
cnf(83,axiom,
f7(X) = lazy_impl(prop(X),X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_f7) ).
cnf(84,axiom,
false2 = phi(f7('SKOLEMAAAU7')),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_false2) ).
cnf(85,axiom,
~ forallprefers(f7(X),f7('SKOLEMAAAU7')),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_false2) ).
cnf(86,axiom,
( bool(X)
| not1(X) = phi(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',not1_axiom1) ).
cnf(87,axiom,
not1(false) = true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',not1_axiom2) ).
cnf(88,axiom,
not1(true) = false,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',not1_axiom3) ).
cnf(89,axiom,
not2(X) = impl(X,false2),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax',def_not2) ).
cnf(90,negated_conjecture,
not1('SKOLEMAAAU8') != not2('SKOLEMAAAU8'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not1_not2) ).
cnf(91,plain,
bool(false),
inference('HYPERRESOLVE',[status(thm)],[2,theory(equality)]) ).
cnf(92,plain,
bool(true),
inference('HYPERRESOLVE',[status(thm)],[3,theory(equality)]) ).
cnf(94,plain,
phi(true) = true,
inference('HYPERRESOLVE',[status(thm)],[33,7]) ).
cnf(95,plain,
phi(false) = false,
inference('HYPERRESOLVE',[status(thm)],[33,8]) ).
cnf(119,plain,
( prop(X) = false
| X = false
| X = true ),
inference('HYPERRESOLVE',[status(thm)],[1,38]) ).
cnf(120,plain,
( not1(X) = phi(X)
| X = false
| X = true ),
inference('HYPERRESOLVE',[status(thm)],[1,86]) ).
cnf(121,plain,
( impl(X,Y) = phi(X)
| prop(X) = true ),
inference('HYPERRESOLVE',[status(thm)],[36,39]) ).
cnf(161,plain,
forallprefers(false,true),
inference('HYPERRESOLVE',[status(thm)],[20,theory(equality),theory(equality)]) ).
cnf(280,plain,
prop(false) = true,
inference('HYPERRESOLVE',[status(thm)],[36,91]) ).
cnf(285,plain,
impl(true,false) = false,
inference('HYPERRESOLVE',[status(thm)],[42,91]) ).
cnf(286,plain,
impl(false,false) = true,
inference('HYPERRESOLVE',[status(thm)],[41,91]) ).
cnf(295,plain,
prop(true) = true,
inference('HYPERRESOLVE',[status(thm)],[36,92]) ).
cnf(322,plain,
f7(false) = false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[83,280,theory(equality)]),95,45,theory(equality)]) ).
cnf(327,plain,
f7(true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[83,295,theory(equality)]),94,45,theory(equality)]) ).
cnf(361,plain,
f7('SKOLEMAAAU7') != true,
inference('UR-RESOLVE',[status(thm)],[20,322,85]) ).
cnf(362,plain,
~ forallprefers(false,f7('SKOLEMAAAU7')),
inference('PARAMODULATE',[status(thm)],[85,322,theory(equality)]) ).
cnf(1573,plain,
( X = false
| X = true
| f7(X) = true ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[83,119,theory(equality)]),44,theory(equality)]) ).
cnf(1593,plain,
( prop(X) = true
| not2(X) = phi(X) ),
inference('PARAMODULATE',[status(thm)],[89,121,theory(equality)]) ).
cnf(1797,plain,
( not2(X) = phi(X)
| X = false
| X = true ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[119,1593,theory(equality)]),4]) ).
cnf(2518,plain,
( 'SKOLEMAAAU7' = false
| 'SKOLEMAAAU7' = true ),
inference('HYPERRESOLVE',[status(thm)],[361,1573]) ).
cnf(2539,plain,
'SKOLEMAAAU7' = false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[362,2518,theory(equality)]),161,327,theory(equality)]) ).
cnf(2540,plain,
false2 = false,
inference('REWRITE',[status(thm)],[84,95,322,2539,theory(equality)]) ).
cnf(2541,plain,
not2(X) = impl(X,false),
inference('REWRITE',[status(thm)],[89,2540,theory(equality)]) ).
cnf(2554,plain,
not2(false) = true,
inference('REWRITE',[status(thm)],[286,2541,theory(equality)]) ).
cnf(2555,plain,
not2(true) = false,
inference('REWRITE',[status(thm)],[285,2541,theory(equality)]) ).
cnf(5997,plain,
( X = false
| X = true
| not1(X) = not2(X) ),
inference('PARAMODULATE',[status(thm)],[120,1797,theory(equality)]) ).
cnf(10507,plain,
( 'SKOLEMAAAU8' = false
| 'SKOLEMAAAU8' = true ),
inference('HYPERRESOLVE',[status(thm)],[90,5997]) ).
cnf(10516,plain,
'SKOLEMAAAU8' = false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[90,10507,theory(equality)]),2555,88,theory(equality)]) ).
cnf(10517,plain,
$false,
inference('REWRITE',[status(thm)],[90,2554,87,10516,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWW102+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 5 10:16:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-05T10:16:19
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-05T10:16:19
% 9.47/9.69
% 9.47/9.69
% 9.47/9.69 #||
% 9.47/9.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.47/9.69 % SZS output start Refutation
% See solution above
% 9.47/9.69 ||#
% 9.47/9.69
% 9.47/9.69 ; Summary of computation:
% 9.47/9.69 ; 69829 formulas have been input or derived (from 594 formulas).
% 9.47/9.69 ; 10517 (15%) were retained. Of these,
% 9.47/9.69 ; 3644 (35%) were simplified or subsumed later,
% 9.47/9.69 ; 6873 (65%) are still being kept.
% 9.47/9.69 ;
% 9.47/9.69 ; Run time in seconds excluding printing time:
% 9.47/9.69 ; 0.010 0% Read assertion file (1 call)
% 9.47/9.69 ; 0.002 0% Assert (45 calls)
% 9.47/9.69 ; 0.996 11% Process new row (69,052 calls)
% 9.47/9.69 ; 0.835 9% Resolution (1,186 calls)
% 9.47/9.69 ; 0.204 2% Paramodulation (593 calls)
% 9.47/9.69 ; 0.002 0% Factoring (409 calls)
% 9.47/9.70 ; 0.489 5% Condensing (35,944 calls)
% 9.47/9.70 ; 3.346 36% Forward subsumption (35,944 calls)
% 9.47/9.70 ; 0.480 5% Backward subsumption (10,302 calls)
% 9.47/9.70 ; 0.629 7% Clause clause subsumption (154,594 calls)
% 9.47/9.70 ; 1.590 17% Forward simplification (68,151 calls)
% 9.47/9.70 ; 0.174 2% Backward simplification (10,509 calls)
% 9.47/9.70 ; 0.227 2% Ordering (134,139 calls)
% 9.47/9.70 ; 0.001 0% Sortal reasoning (32 calls)
% 9.47/9.70 ; 0.001 0% Purity testing (1 call)
% 9.47/9.70 ; 0.236 3% Other
% 9.47/9.70 ; 9.222 Total
% 9.47/9.70 ; 9.226 Real time
% 9.47/9.70 ;
% 9.47/9.70 ; Term-hash-array has 5,693 terms in all.
% 9.47/9.70 ; Feature-vector-row-index has 6,699 entries (9,238 at peak, 10,302 added, 3,603 deleted).
% 9.47/9.70 ; Feature-vector-row-index has 32,716 nodes (44,287 at peak, 49,276 added, 16,560 deleted).
% 9.47/9.70 ; Retrieved 375,316 possibly forward subsuming rows in 35,944 calls.
% 9.47/9.70 ; Retrieved 12,003 possibly backward subsumed rows in 10,302 calls.
% 9.47/9.70 ; Path-index has 4,789 entries (5,253 at peak, 5,841 added, 1,052 deleted).
% 9.47/9.70 ; Path-index has 7,517 nodes (7,576 at peak, 7,936 added, 419 deleted).
% 9.47/9.70 ; Trie-index has 4,789 entries (5,253 at peak, 5,841 added, 1,052 deleted).
% 9.47/9.70 ; Trie-index has 14,345 nodes (14,993 at peak, 16,407 added, 2,062 deleted).
% 9.47/9.70 ; Retrieved 116,022 generalization terms in 533,155 calls.
% 9.47/9.70 ; Retrieved 252 instance terms in 206 calls.
% 9.47/9.70 ; Retrieved 125,385 unifiable terms in 11,794 calls.
% 9.47/9.70 ;
% 9.47/9.70 ; The agenda of backward simplifiable rows to process has 4 entries:
% 9.47/9.70 ; 4 with value 0
% 9.47/9.70 ; The agenda of rows to process has 77 entries:
% 9.47/9.70 ; 1 with value 18 10 with value 23 36 with value 25
% 9.47/9.70 ; 2 with value 19 18 with value 24 8 with value 26
% 9.47/9.70 ; 2 with value 22
% 9.47/9.70 ; The agenda of rows to give has 6343 entries:
% 9.47/9.70 ; 1 with value (4 10) 67 with value (4 37) 89 with value (4 55)
% 9.47/9.70 ; 31 with value (4 19) 230 with value (4 38) 62 with value (4 56)
% 9.47/9.70 ; 91 with value (4 20) 190 with value (4 39) 27 with value (4 57)
% 9.47/9.70 ; 91 with value (4 21) 133 with value (4 40) 59 with value (4 58)
% 9.47/9.70 ; 120 with value (4 22) 330 with value (4 41) 26 with value (4 59)
% 9.47/9.70 ; 159 with value (4 23) 189 with value (4 42) 8 with value (4 60)
% 9.47/9.70 ; 104 with value (4 24) 333 with value (4 43) 12 with value (4 61)
% 9.47/9.70 ; 165 with value (4 25) 144 with value (4 44) 12 with value (4 62)
% 9.47/9.70 ; 158 with value (4 26) 170 with value (4 45) 6 with value (4 63)
% 9.47/9.70 ; 318 with value (4 27) 181 with value (4 46) 6 with value (4 64)
% 9.47/9.70 ; 293 with value (4 28) 157 with value (4 47) 6 with value (4 65)
% 9.47/9.70 ; 412 with value (4 29) 306 with value (4 48) 1 with value (4 66)
% 9.47/9.70 ; 388 with value (4 30) 178 with value (4 49) 1 with value (4 67)
% 9.47/9.70 ; 56 with value (4 31) 181 with value (4 50) 1 with value (4 68)
% 9.47/9.70 ; 66 with value (4 32) 108 with value (4 51) 2 with value (4 78)
% 9.47/9.70 ; 43 with value (4 33) 100 with value (4 52) 2 with value (4 80)
% 9.47/9.70 ; 73 with value (4 34) 88 with value (4 53) 1 with value (4 90)
% 9.47/9.70 ; 127 with value (4 35) 71 with value (4 54) 1 with value (4 92)
% 9.47/9.70 ; 169 with value (4 36)
% 9.47/9.70 Evaluation took:
% 9.47/9.70 9.229 seconds of real time
% 9.47/9.70 8.476713 seconds of user run time
% 9.47/9.70 0.751892 seconds of system run time
% 9.47/9.70 [Run times include 0.88 seconds GC run time.]
% 9.47/9.70 0 calls to %EVAL
% 9.47/9.70 0 page faults and
% 9.47/9.70 900,307,288 bytes consed.
% 9.47/9.70 :PROOF-FOUND
% 9.47/9.70 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-05T10:16:28
% 9.47/9.70 :PROOF-FOUND
% 9.47/9.70 *
%------------------------------------------------------------------------------