TSTP Solution File: SYN037-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYN037-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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 11:56:50 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 22
% Syntax : Number of clauses : 53 ( 5 unt; 34 nHn; 28 RR)
% Number of literals : 152 ( 0 equ; 50 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-1 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 41 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
( ~ m1
| ~ m3
| ~ p(X)
| ~ p(fy(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
( ~ m1
| ~ m3
| p(X)
| p(fy(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,negated_conjecture,
( ~ m1
| ~ p(cx)
| m3
| p(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_4,negated_conjecture,
( ~ m1
| ~ p(X)
| m3
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_5,negated_conjecture,
( ~ m2
| ~ m3
| ~ q(cw)
| q(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_6,negated_conjecture,
( ~ m2
| ~ m3
| ~ q(X)
| q(cw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( ~ m2
| ~ q(X)
| ~ q(fz5(X))
| m3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_8,negated_conjecture,
( ~ m2
| m3
| q(X)
| q(fz5(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_9,negated_conjecture,
( ~ m3
| ~ p(cx)
| m1
| p(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_10,negated_conjecture,
( ~ m3
| ~ p(X)
| m1
| p(cx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_11,negated_conjecture,
( ~ m3
| ~ q(X)
| ~ q(fz2(X))
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_12,negated_conjecture,
( ~ m3
| m2
| q(X)
| q(fz2(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_13,negated_conjecture,
( ~ p(X)
| ~ p(fy3(X))
| m1
| m3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_14,negated_conjecture,
( ~ q(cw)
| m2
| m3
| q(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_15,negated_conjecture,
( ~ q(X)
| m2
| m3
| q(cw) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_16,negated_conjecture,
( m1
| m3
| p(X)
| p(fy3(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
cnf(clause_17,negated_conjecture,
( ~ m1
| ~ q(X)
| q(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_18,negated_conjecture,
( ~ m2
| ~ p(X)
| p(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).
cnf(clause_19,negated_conjecture,
( ~ p(cvv)
| m2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_20,negated_conjecture,
( ~ q(cuu)
| m1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_21,negated_conjecture,
( m2
| p(cv) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_22,negated_conjecture,
( m1
| q(cu) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
cnf(23,plain,
( m1
| m2
| m3
| q(cw) ),
inference('HYPERRESOLVE',[status(thm)],[clause_15,clause_22]) ).
cnf(24,plain,
( m1
| m2
| m3
| q(X) ),
inference('HYPERRESOLVE',[status(thm)],[clause_14,23]) ).
cnf(25,plain,
( m1
| m2
| m3 ),
inference('HYPERRESOLVE',[status(thm)],[clause_20,24]) ).
cnf(26,plain,
( m1
| m2
| p(cx) ),
inference('HYPERRESOLVE',[status(thm)],[clause_10,25,clause_21]) ).
cnf(28,plain,
( m1
| m2
| p(X) ),
inference('HYPERRESOLVE',[status(thm)],[clause_9,26,25]) ).
cnf(29,plain,
( m1
| m2 ),
inference('HYPERRESOLVE',[status(thm)],[clause_19,28]) ).
cnf(30,plain,
( m1
| m3
| p(X) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_18,29,clause_16])]) ).
cnf(32,plain,
( m1
| m3 ),
inference('HYPERRESOLVE',[status(thm)],[clause_13,30,30]) ).
cnf(33,plain,
( m1
| q(cw) ),
inference('HYPERRESOLVE',[status(thm)],[clause_6,32,29,clause_22]) ).
cnf(34,plain,
( m1
| q(X) ),
inference('HYPERRESOLVE',[status(thm)],[clause_5,33,29,32]) ).
cnf(35,plain,
m1,
inference('HYPERRESOLVE',[status(thm)],[clause_20,34]) ).
cnf(36,plain,
( ~ m3
| ~ p(X)
| ~ p(fy(X)) ),
inference('REWRITE',[status(thm)],[clause_1,35]) ).
cnf(37,plain,
( ~ m3
| p(X)
| p(fy(X)) ),
inference('REWRITE',[status(thm)],[clause_2,35]) ).
cnf(38,plain,
( ~ p(cx)
| m3
| p(X) ),
inference('REWRITE',[status(thm)],[clause_3,35]) ).
cnf(39,plain,
( ~ p(X)
| m3
| p(cx) ),
inference('REWRITE',[status(thm)],[clause_4,35]) ).
cnf(40,plain,
( ~ q(X)
| q(Y) ),
inference('REWRITE',[status(thm)],[clause_17,35]) ).
cnf(41,plain,
( m2
| m3
| p(cx) ),
inference('HYPERRESOLVE',[status(thm)],[39,clause_21]) ).
cnf(42,plain,
( m2
| m3
| p(X) ),
inference('HYPERRESOLVE',[status(thm)],[38,41]) ).
cnf(43,plain,
( m2
| m3 ),
inference('HYPERRESOLVE',[status(thm)],[clause_19,42]) ).
cnf(45,plain,
( m2
| q(X)
| q(fz2(X)) ),
inference('HYPERRESOLVE',[status(thm)],[clause_12,43]) ).
cnf(46,plain,
( m2
| q(X) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[40,45])]) ).
cnf(47,plain,
m2,
inference('HYPERRESOLVE',[status(thm)],[clause_11,46,43,46]) ).
cnf(48,plain,
( ~ q(X)
| ~ q(fz5(X))
| m3 ),
inference('REWRITE',[status(thm)],[clause_7,47]) ).
cnf(49,plain,
( m3
| q(X)
| q(fz5(X)) ),
inference('REWRITE',[status(thm)],[clause_8,47]) ).
cnf(50,plain,
( ~ p(X)
| p(Y) ),
inference('REWRITE',[status(thm)],[clause_18,47]) ).
cnf(51,plain,
( m3
| q(X) ),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[40,49])]) ).
cnf(52,plain,
m3,
inference('HYPERRESOLVE',[status(thm)],[48,51,51]) ).
cnf(53,plain,
( ~ p(X)
| ~ p(fy(X)) ),
inference('REWRITE',[status(thm)],[36,52]) ).
cnf(54,plain,
( p(X)
| p(fy(X)) ),
inference('REWRITE',[status(thm)],[37,52]) ).
cnf(55,plain,
p(X),
inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[50,54])]) ).
cnf(56,plain,
$false,
inference('REWRITE',[status(thm)],[53,55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN037-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n008.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 Jul 11 19:18:23 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.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T19:18:23
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-11T19:18:23
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 #||
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.53 ||#
% 0.20/0.53
% 0.20/0.53 ; Summary of computation:
% 0.20/0.53 ; 108 formulas have been input or derived (from 51 formulas).
% 0.20/0.53 ; 56 (52%) were retained. Of these,
% 0.20/0.53 ; 50 (89%) were simplified or subsumed later,
% 0.20/0.53 ; 6 (11%) are still being kept.
% 0.20/0.53 ;
% 0.20/0.53 ; Run time in seconds excluding printing time:
% 0.20/0.53 ; 0.004 10% Read assertion file (1 call)
% 0.20/0.53 ; 0.001 2% Assert (22 calls)
% 0.20/0.53 ; 0.001 2% Process new row (99 calls)
% 0.20/0.53 ; 0.005 12% Resolution (100 calls)
% 0.20/0.53 ; 0.000 0% Paramodulation (50 calls)
% 0.20/0.53 ; 0.000 0% Factoring (22 calls)
% 0.20/0.53 ; 0.002 5% Condensing (63 calls)
% 0.20/0.53 ; 0.001 2% Forward subsumption (62 calls)
% 0.20/0.53 ; 0.001 2% Backward subsumption (51 calls)
% 0.20/0.53 ; 0.000 0% Clause clause subsumption (34 calls)
% 0.20/0.53 ; 0.002 5% Forward simplification (68 calls)
% 0.20/0.53 ; 0.000 0% Backward simplification (56 calls)
% 0.20/0.53 ; 0.000 0% Ordering (86 calls)
% 0.20/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.53 ; 0.000 0% Purity testing (1 call)
% 0.20/0.53 ; 0.023 58% Other
% 0.20/0.53 ; 0.040 Total
% 0.20/0.53 ; 0.046 Real time
% 0.20/0.53 ;
% 0.20/0.53 ; Term-hash-array has 18 terms in all.
% 0.20/0.53 ; Feature-vector-row-index has 1 entry (25 at peak, 51 added, 50 deleted).
% 0.20/0.53 ; Feature-vector-row-index has 3 nodes (97 at peak, 156 added, 153 deleted).
% 0.20/0.53 ; Retrieved 12 possibly forward subsuming rows in 62 calls.
% 0.20/0.53 ; Retrieved 23 possibly backward subsumed rows in 51 calls.
% 0.20/0.53 ; Path-index has 6 entries (27 at peak, 37 added, 31 deleted).
% 0.20/0.53 ; Path-index has 16 nodes (36 at peak, 44 added, 28 deleted).
% 0.20/0.53 ; Trie-index has 6 entries (27 at peak, 37 added, 31 deleted).
% 0.20/0.53 ; Trie-index has 8 nodes (36 at peak, 50 added, 42 deleted).
% 0.20/0.53 ; Retrieved 2 generalization terms in 2 calls.
% 0.20/0.53 ; Retrieved 5 instance terms in 4 calls.
% 0.20/0.53 ; Retrieved 548 unifiable terms in 294 calls.
% 0.20/0.53 ;
% 0.20/0.53 ; The agenda of rows to process has 2 entries:
% 0.20/0.53 ; 2 with value 9
% 0.20/0.53 ; The agenda of rows to give has 3 entries:
% 0.20/0.53 ; 1 with value (4 3) 1 with value (4 4) 1 with value (4 7)
% 0.20/0.53 Evaluation took:
% 0.20/0.53 0.046 seconds of real time
% 0.20/0.53 0.037612 seconds of user run time
% 0.20/0.53 0.007991 seconds of system run time
% 0.20/0.53 0 calls to %EVAL
% 0.20/0.53 0 page faults and
% 0.20/0.53 4,888,744 bytes consed.
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T19:18:23
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 *
%------------------------------------------------------------------------------