TSTP Solution File: LDA002-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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 : Sun Jul 17 16:45:49 EDT 2022
% Result : Unsatisfiable 0.58s 0.79s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 41 RR)
% Number of literals : 57 ( 56 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a1,axiom,
f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
cnf(clause_2,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_4,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_5,axiom,
u1 = f(u,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_6,axiom,
u2 = f(u,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_7,axiom,
u3 = f(u,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_8,axiom,
uu = f(u,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_9,axiom,
a = f(f(n3,n2),u2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_10,axiom,
b = f(u1,u3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_11,axiom,
v = f(uu,uu),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(prove_equation,negated_conjecture,
f(a,v) != f(b,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
cnf(13,plain,
f(X,v) = f(f(X,uu),f(X,uu)),
inference('PARAMODULATE',[status(thm)],[a1,clause_11,theory(equality)]) ).
cnf(15,plain,
f(X,uu) = f(f(X,u),f(X,u)),
inference('PARAMODULATE',[status(thm)],[a1,clause_8,theory(equality)]) ).
cnf(16,plain,
f(X,u3) = f(f(X,u),f(X,n3)),
inference('PARAMODULATE',[status(thm)],[a1,clause_7,theory(equality)]) ).
cnf(17,plain,
f(X,n2) = f(f(X,n1),f(X,n1)),
inference('PARAMODULATE',[status(thm)],[a1,clause_2,theory(equality)]) ).
cnf(18,plain,
f(X,n3) = f(f(X,n2),f(X,n1)),
inference('PARAMODULATE',[status(thm)],[a1,clause_3,theory(equality)]) ).
cnf(20,plain,
f(X,u) = f(f(X,n2),f(X,n2)),
inference('PARAMODULATE',[status(thm)],[a1,clause_4,theory(equality)]) ).
cnf(21,plain,
f(X,u2) = f(f(X,u),f(X,n2)),
inference('PARAMODULATE',[status(thm)],[a1,clause_6,theory(equality)]) ).
cnf(26,plain,
f(n1,f(n1,X)) = f(n2,f(n1,X)),
inference('PARAMODULATE',[status(thm)],[a1,clause_2,theory(equality)]) ).
cnf(27,plain,
f(n1,f(n1,X)) = f(n3,f(n2,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[a1,clause_3,theory(equality)]),26,theory(equality)]) ).
cnf(28,plain,
f(u,f(n1,X)) = f(u1,f(u,X)),
inference('PARAMODULATE',[status(thm)],[a1,clause_5,theory(equality)]) ).
cnf(29,plain,
f(n2,f(n2,X)) = f(u,f(n2,X)),
inference('PARAMODULATE',[status(thm)],[a1,clause_4,theory(equality)]) ).
cnf(30,plain,
f(n2,f(n2,X)) = f(u2,f(u,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[a1,clause_6,theory(equality)]),29,theory(equality)]) ).
cnf(31,plain,
f(uu,f(X,uu)) = f(f(uu,X),v),
inference('PARAMODULATE',[status(thm)],[a1,clause_11,theory(equality)]) ).
cnf(50,plain,
f(uu,v) = f(v,v),
inference('PARAMODULATE',[status(thm)],[13,clause_11,theory(equality)]) ).
cnf(64,plain,
f(u,uu) = v,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,clause_8,theory(equality)]),clause_11,theory(equality)]) ).
cnf(68,plain,
f(u,v) = f(uu,v),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,64,theory(equality)]),50,theory(equality)]) ).
cnf(69,plain,
f(u,v) = f(v,v),
inference('REWRITE',[status(thm)],[50,68,theory(equality)]) ).
cnf(87,plain,
f(n1,n2) = u,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,clause_2,theory(equality)]),clause_4,theory(equality)]) ).
cnf(111,plain,
f(n1,n3) = u2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,clause_2,theory(equality)]),clause_6,87,theory(equality)]) ).
cnf(123,plain,
f(n1,u3) = f(f(n1,u),u2),
inference('PARAMODULATE',[status(thm)],[16,111,theory(equality)]) ).
cnf(138,plain,
f(n2,u) = uu,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,clause_4,theory(equality)]),clause_8,theory(equality)]) ).
cnf(145,plain,
f(n1,u) = uu,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,87,theory(equality)]),clause_8,theory(equality)]) ).
cnf(146,plain,
f(n1,u3) = f(uu,u2),
inference('REWRITE',[status(thm)],[123,145,theory(equality)]) ).
cnf(150,plain,
f(n2,uu) = v,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,138,theory(equality)]),clause_11,theory(equality)]) ).
cnf(152,plain,
f(X,uu) = f(f(X,n2),f(X,u)),
inference('PARAMODULATE',[status(thm)],[a1,138,theory(equality)]) ).
cnf(158,plain,
f(n1,uu) = v,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,145,theory(equality)]),clause_11,theory(equality)]) ).
cnf(163,plain,
f(n2,v) = f(u,v),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,150,theory(equality)]),69,theory(equality)]) ).
cnf(164,plain,
f(n2,v) = f(uu,v),
inference('REWRITE',[status(thm)],[68,163,theory(equality)]) ).
cnf(165,plain,
f(n2,v) = f(v,v),
inference('REWRITE',[status(thm)],[69,163,theory(equality)]) ).
cnf(176,plain,
f(n1,v) = f(n2,v),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,158,theory(equality)]),165,theory(equality)]) ).
cnf(178,plain,
f(n1,v) = f(uu,v),
inference('REWRITE',[status(thm)],[164,176,theory(equality)]) ).
cnf(179,plain,
f(n1,v) = f(v,v),
inference('REWRITE',[status(thm)],[165,176,theory(equality)]) ).
cnf(215,plain,
f(u,u2) = f(n1,u3),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[21,clause_8,theory(equality)]),146,clause_6,theory(equality)]) ).
cnf(216,plain,
f(u,u2) = f(uu,u2),
inference('REWRITE',[status(thm)],[146,215,theory(equality)]) ).
cnf(257,plain,
uu = f(n3,u),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,clause_4,theory(equality)]),145,87,theory(equality)]) ).
cnf(259,plain,
v = f(n3,uu),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,138,theory(equality)]),158,145,theory(equality)]) ).
cnf(283,plain,
f(u,u2) = b,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,clause_7,theory(equality)]),clause_10,111,theory(equality)]) ).
cnf(285,plain,
b = f(uu,u2),
inference('REWRITE',[status(thm)],[216,283,theory(equality)]) ).
cnf(336,plain,
v = f(u2,uu),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,clause_8,theory(equality)]),150,138,theory(equality)]) ).
cnf(344,plain,
f(X,v) = f(f(X,u2),f(X,uu)),
inference('PARAMODULATE',[status(thm)],[a1,336,theory(equality)]) ).
cnf(354,plain,
f(n1,v) = f(b,v),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[31,285,theory(equality)]),178,336,theory(equality)]) ).
cnf(358,plain,
f(b,v) = f(v,v),
inference('REWRITE',[status(thm)],[179,354,theory(equality)]) ).
cnf(704,plain,
v = f(f(n3,n2),uu),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[152,257,theory(equality)]),259,theory(equality)]) ).
cnf(708,plain,
f(f(n3,n2),v) = f(b,v),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,704,theory(equality)]),358,theory(equality)]) ).
cnf(920,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[344,clause_9,theory(equality)]),prove_equation,704,708,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n022.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 May 30 03:00:08 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.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-05-30T03:00:08
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-05-30T03:00:08
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 #||
% 0.58/0.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.79 % SZS output start Refutation
% See solution above
% 0.65/0.80 ||#
% 0.65/0.80
% 0.65/0.80 ; Summary of computation:
% 0.65/0.80 ; 1910 formulas have been input or derived (from 183 formulas).
% 0.65/0.80 ; 920 (48%) were retained. Of these,
% 0.65/0.80 ; 181 (20%) were simplified or subsumed later,
% 0.65/0.80 ; 739 (80%) are still being kept.
% 0.65/0.80 ;
% 0.65/0.80 ; Run time in seconds excluding printing time:
% 0.65/0.80 ; 0.001 0% Read assertion file (1 call)
% 0.65/0.80 ; 0.001 0% Assert (12 calls)
% 0.65/0.80 ; 0.086 27% Process new row (1,899 calls)
% 0.65/0.80 ; 0.003 1% Resolution (364 calls)
% 0.65/0.80 ; 0.034 11% Paramodulation (182 calls)
% 0.65/0.80 ; 0.059 19% Forward simplification (1,898 calls)
% 0.65/0.80 ; 0.020 6% Backward simplification (920 calls)
% 0.65/0.80 ; 0.072 23% Ordering (10,105 calls)
% 0.65/0.80 ; 0.000 0% Sortal reasoning (32 calls)
% 0.65/0.80 ; 0.000 0% Purity testing (1 call)
% 0.65/0.80 ; 0.040 13% Other
% 0.65/0.80 ; 0.316 Total
% 0.65/0.80 ; 0.321 Real time
% 0.65/0.80 ;
% 0.65/0.80 ; Term-hash-array has 2,614 terms in all.
% 0.65/0.80 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.65/0.80 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.65/0.80 ; Path-index has 2,212 entries (2,212 at peak, 2,751 added, 539 deleted).
% 0.65/0.80 ; Path-index has 366 nodes (366 at peak, 397 added, 31 deleted).
% 0.65/0.80 ; Trie-index has 2,212 entries (2,212 at peak, 2,751 added, 539 deleted).
% 0.65/0.80 ; Trie-index has 8,942 nodes (8,942 at peak, 10,738 added, 1,796 deleted).
% 0.65/0.80 ; Retrieved 8,178 generalization terms in 11,841 calls.
% 0.65/0.80 ; Retrieved 1,421 instance terms in 1,157 calls.
% 0.65/0.80 ; Retrieved 5,140 unifiable terms in 1,238 calls.
% 0.65/0.80 ;
% 0.65/0.80 ; The agenda of rows to process has 11 entries:
% 0.65/0.80 ; 2 with value 22 1 with value 24 2 with value 27
% 0.65/0.80 ; 1 with value 23 5 with value 25
% 0.65/0.80 ; The agenda of rows to give has 572 entries:
% 0.65/0.80 ; 17 with value (4 17) 21 with value (4 22) 25 with value (4 26)
% 0.65/0.80 ; 48 with value (4 18) 105 with value (4 23) 44 with value (4 27)
% 0.65/0.80 ; 37 with value (4 19) 40 with value (4 24) 1 with value (4 28)
% 0.65/0.80 ; 46 with value (4 20) 150 with value (4 25) 3 with value (4 29)
% 0.65/0.80 ; 35 with value (4 21)
% 0.65/0.80 Evaluation took:
% 0.65/0.80 0.322 seconds of real time
% 0.65/0.80 0.286159 seconds of user run time
% 0.65/0.80 0.035196 seconds of system run time
% 0.65/0.80 [Run times include 0.012 seconds GC run time.]
% 0.65/0.80 0 calls to %EVAL
% 0.65/0.80 0 page faults and
% 0.65/0.80 21,353,440 bytes consed.
% 0.65/0.80 :PROOF-FOUND
% 0.65/0.80 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-30T03:00:08
% 0.65/0.80 :PROOF-FOUND
% 0.65/0.80 *
%------------------------------------------------------------------------------