TSTP Solution File: LAT394-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT394-2 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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 06:45:06 EDT 2022
% Result : Unsatisfiable 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 2 RR)
% Number of literals : 37 ( 36 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos,axiom,
f(f(f(f(X,Y),f(Y,Z)),U),f(Y,f(f(Y,f(f(X,X),X)),Z))) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
cnf(goals,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(3,plain,
f(X,f(f(X,Y),f(f(f(X,Y),f(f(f(Z,X),f(Z,X)),f(Z,X))),U))) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[sos,sos,theory(equality)]) ).
cnf(8,plain,
f(f(X,Y),f(f(f(X,Y),f(Y,Z)),Y)) = f(f(X,Y),f(Y,Z)),
inference('PARAMODULATE',[status(thm)],[3,sos,theory(equality)]) ).
cnf(9,plain,
f(X,f(f(X,Y),f(f(f(Z,X),f(Z,X)),f(Z,X)))) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[3,3,theory(equality)]) ).
cnf(16,plain,
f(f(f(f(X,Y),f(Y,Z)),Y),f(Y,Y)) = Y,
inference('PARAMODULATE',[status(thm)],[8,sos,theory(equality)]) ).
cnf(25,plain,
f(f(X,X),f(X,X)) = X,
inference('PARAMODULATE',[status(thm)],[16,16,theory(equality)]) ).
cnf(26,plain,
f(X,f(f(X,f(f(X,X),Y)),f(X,X))) = f(X,f(f(X,X),Y)),
inference('PARAMODULATE',[status(thm)],[8,16,theory(equality)]) ).
cnf(37,plain,
f(f(f(f(X,f(Y,Y)),Y),f(Y,Y)),Y) = f(Y,Y),
inference('PARAMODULATE',[status(thm)],[16,25,theory(equality)]) ).
cnf(38,plain,
f(f(X,Y),f(X,f(f(X,f(f(X,X),X)),X))) = X,
inference('PARAMODULATE',[status(thm)],[sos,25,theory(equality)]) ).
cnf(61,plain,
f(X,f(f(X,Y),f(X,f(X,X)))) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[9,25,theory(equality)]) ).
cnf(78,plain,
f(f(f(f(X,Y),f(Y,f(Y,f(Y,Y)))),Z),f(Y,f(f(X,X),X))) = Y,
inference('PARAMODULATE',[status(thm)],[sos,61,theory(equality)]) ).
cnf(98,plain,
f(X,f(f(X,Y),f(X,Y))) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[3,38,theory(equality)]) ).
cnf(99,plain,
f(X,X) = f(X,f(f(X,f(f(X,X),X)),X)),
inference('PARAMODULATE',[status(thm)],[25,38,theory(equality)]) ).
cnf(100,plain,
f(f(X,Y),f(X,X)) = X,
inference('REWRITE',[status(thm)],[38,99,theory(equality)]) ).
cnf(101,plain,
f(X,X) = f(X,f(f(X,X),Y)),
inference('REWRITE',[status(thm)],[26,100,theory(equality)]) ).
cnf(117,plain,
f(f(X,X),f(f(f(f(Y,f(X,X)),X),f(X,X)),f(f(f(Y,f(X,X)),X),f(X,X)))) = f(f(f(Y,f(X,X)),X),f(X,X)),
inference('PARAMODULATE',[status(thm)],[100,37,theory(equality)]) ).
cnf(118,plain,
X = f(f(X,X),f(X,Y)),
inference('PARAMODULATE',[status(thm)],[101,100,theory(equality)]) ).
cnf(120,plain,
f(f(f(X,Y),f(Y,Z)),f(f(X,Y),f(Y,Z))) = f(f(f(X,Y),f(Y,Z)),Y),
inference('PARAMODULATE',[status(thm)],[101,sos,theory(equality)]) ).
cnf(121,plain,
X = f(f(f(Y,f(X,X)),X),f(X,X)),
inference('REWRITE',[status(thm)],[117,100,37,120,theory(equality)]) ).
cnf(134,plain,
f(X,Y) = f(f(f(X,Y),f(X,Y)),X),
inference('PARAMODULATE',[status(thm)],[118,100,theory(equality)]) ).
cnf(154,plain,
f(X,X) = f(f(f(Y,X),f(X,X)),X),
inference('PARAMODULATE',[status(thm)],[121,118,theory(equality)]) ).
cnf(175,plain,
f(f(X,Y),f(Y,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[118,154,theory(equality)]),100,154,120,theory(equality)]) ).
cnf(177,plain,
X = f(f(X,X),f(Y,X)),
inference('PARAMODULATE',[status(thm)],[134,175,theory(equality)]) ).
cnf(184,plain,
f(X,f(f(Y,X),f(Y,X))) = f(Y,X),
inference('PARAMODULATE',[status(thm)],[100,175,theory(equality)]) ).
cnf(194,plain,
f(X,X) = f(X,f(Y,f(X,X))),
inference('PARAMODULATE',[status(thm)],[177,177,theory(equality)]) ).
cnf(195,plain,
f(f(X,Y),f(X,f(f(Z,Z),Z))) = X,
inference('REWRITE',[status(thm)],[78,175,194,theory(equality)]) ).
cnf(211,plain,
f(X,X) = f(X,f(f(Y,Y),Y)),
inference('PARAMODULATE',[status(thm)],[98,195,theory(equality)]) ).
cnf(213,plain,
f(f(X,Y),f(X,f(Z,f(Z,Z)))) = X,
inference('PARAMODULATE',[status(thm)],[195,118,theory(equality)]) ).
cnf(235,plain,
X = f(f(X,X),f(f(Y,Y),Y)),
inference('PARAMODULATE',[status(thm)],[118,211,theory(equality)]) ).
cnf(236,plain,
f(X,X) = f(X,f(Y,f(Y,Y))),
inference('PARAMODULATE',[status(thm)],[211,118,theory(equality)]) ).
cnf(250,plain,
X = f(f(X,X),f(Y,f(Y,Y))),
inference('PARAMODULATE',[status(thm)],[235,118,theory(equality)]) ).
cnf(294,plain,
f(f(X,f(X,X)),f(Y,Y)) = Y,
inference('PARAMODULATE',[status(thm)],[184,250,theory(equality)]) ).
cnf(298,plain,
f(f(X,f(X,X)),Y) = f(Y,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[184,236,theory(equality)]),177,theory(equality)]) ).
cnf(315,plain,
f(X,f(f(Y,f(Y,Y)),f(Z,f(Z,Z)))) = f(Y,f(Y,Y)),
inference('PARAMODULATE',[status(thm)],[213,294,theory(equality)]) ).
cnf(385,plain,
f(X,f(X,X)) = f(Y,f(Y,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[213,298,theory(equality)]),315,theory(equality)]) ).
cnf(386,plain,
$false,
inference('REWRITE',[status(thm)],[goals,385,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LAT394-2 : TPTP v8.1.0. Released v5.4.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n011.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 : Wed Jun 29 20:08:02 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-06-29T20:08:02
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-29T20:08:02
% 0.57/0.74
% 0.57/0.74
% 0.57/0.74 #||
% 0.57/0.74 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.57/0.74 % SZS output start Refutation
% See solution above
% 0.57/0.75 ||#
% 0.57/0.75
% 0.57/0.75 ; Summary of computation:
% 0.57/0.75 ; 1811 formulas have been input or derived (from 38 formulas).
% 0.57/0.75 ; 386 (21%) were retained. Of these,
% 0.57/0.75 ; 195 (51%) were simplified or subsumed later,
% 0.57/0.75 ; 191 (49%) are still being kept.
% 0.57/0.75 ;
% 0.57/0.75 ; Run time in seconds excluding printing time:
% 0.57/0.75 ; 0.001 0% Read assertion file (1 call)
% 0.57/0.75 ; 0.000 0% Assert (2 calls)
% 0.57/0.75 ; 0.061 23% Process new row (1,628 calls)
% 0.57/0.75 ; 0.003 1% Resolution (74 calls)
% 0.57/0.75 ; 0.041 16% Paramodulation (37 calls)
% 0.57/0.75 ; 0.054 20% Forward simplification (1,559 calls)
% 0.57/0.75 ; 0.061 23% Backward simplification (386 calls)
% 0.57/0.75 ; 0.016 6% Ordering (4,853 calls)
% 0.57/0.75 ; 0.001 0% Sortal reasoning (32 calls)
% 0.57/0.75 ; 0.000 0% Purity testing (1 call)
% 0.57/0.75 ; 0.026 10% Other
% 0.57/0.75 ; 0.264 Total
% 0.57/0.75 ; 0.267 Real time
% 0.57/0.75 ;
% 0.57/0.75 ; Term-hash-array has 1,416 terms in all.
% 0.57/0.75 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.57/0.75 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.57/0.75 ; Path-index has 552 entries (559 at peak, 1,497 added, 945 deleted).
% 0.57/0.75 ; Path-index has 2,040 nodes (2,818 at peak, 3,021 added, 981 deleted).
% 0.57/0.75 ; Trie-index has 552 entries (559 at peak, 1,497 added, 945 deleted).
% 0.57/0.75 ; Trie-index has 2,444 nodes (8,974 at peak, 14,525 added, 12,081 deleted).
% 0.57/0.75 ; Retrieved 15,011 generalization terms in 11,647 calls.
% 0.57/0.75 ; Retrieved 7,165 instance terms in 406 calls.
% 0.57/0.75 ; Retrieved 12,724 unifiable terms in 271 calls.
% 0.57/0.75 ;
% 0.57/0.75 ; The agenda of rows to process has 22 entries:
% 0.57/0.75 ; 3 with value 41 1 with value 49 1 with value 55
% 0.57/0.75 ; 4 with value 42 1 with value 50 4 with value 56
% 0.57/0.75 ; 5 with value 46 1 with value 51 1 with value 60
% 0.57/0.75 ; 1 with value 47
% 0.57/0.75 ; The agenda of rows to give has 166 entries:
% 0.57/0.75 ; 3 with value (4 25) 9 with value (4 34) 1 with value (4 44)
% 0.57/0.75 ; 1 with value (4 26) 16 with value (4 35) 1 with value (4 47)
% 0.57/0.75 ; 5 with value (4 27) 11 with value (4 36) 1 with value (4 50)
% 0.57/0.75 ; 9 with value (4 28) 2 with value (4 37) 1 with value (4 51)
% 0.57/0.75 ; 17 with value (4 29) 4 with value (4 38) 1 with value (4 54)
% 0.57/0.75 ; 15 with value (4 30) 1 with value (4 39) 1 with value (4 60)
% 0.57/0.75 ; 23 with value (4 31) 1 with value (4 40) 1 with value (4 61)
% 0.57/0.75 ; 33 with value (4 32) 2 with value (4 42) 1 with value (4 64)
% 0.57/0.75 ; 2 with value (4 33) 3 with value (4 43) 1 with value (4 77)
% 0.57/0.75 Evaluation took:
% 0.57/0.75 0.268 seconds of real time
% 0.57/0.75 0.243635 seconds of user run time
% 0.57/0.75 0.024003 seconds of system run time
% 0.57/0.75 [Run times include 0.008 seconds GC run time.]
% 0.57/0.75 0 calls to %EVAL
% 0.57/0.75 0 page faults and
% 0.57/0.75 21,044,912 bytes consed.
% 0.57/0.75 :PROOF-FOUND
% 0.57/0.75 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-29T20:08:03
% 0.57/0.75 :PROOF-FOUND
% 0.57/0.75 *
%------------------------------------------------------------------------------