TSTP Solution File: LDA001-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LDA001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 17 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a1,axiom,
f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1) ).
cnf(clause_2,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_4,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(prove_equation,negated_conjecture,
f(f(n3,n2),u) != f(f(u,u),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(6,plain,
f(X,n2) = f(f(X,n1),f(X,n1)),
inference('PARAMODULATE',[status(thm)],[a1,clause_2,theory(equality)]) ).
cnf(7,plain,
f(X,n3) = f(f(X,n2),f(X,n1)),
inference('PARAMODULATE',[status(thm)],[a1,clause_3,theory(equality)]) ).
cnf(8,plain,
f(X,u) = f(f(X,n2),f(X,n2)),
inference('PARAMODULATE',[status(thm)],[a1,clause_4,theory(equality)]) ).
cnf(9,plain,
f(n1,f(n1,X)) = f(n2,f(n1,X)),
inference('PARAMODULATE',[status(thm)],[a1,clause_2,theory(equality)]) ).
cnf(10,plain,
f(n1,f(n1,X)) = f(n3,f(n2,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[a1,clause_3,theory(equality)]),9,theory(equality)]) ).
cnf(14,plain,
f(n2,f(X,n2)) = f(f(n2,X),u),
inference('PARAMODULATE',[status(thm)],[a1,clause_4,theory(equality)]) ).
cnf(21,plain,
f(n1,n2) = u,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,clause_2,theory(equality)]),clause_4,theory(equality)]) ).
cnf(22,plain,
u = f(n3,n3),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,clause_3,theory(equality)]),clause_4,theory(equality)]) ).
cnf(31,plain,
f(n3,f(X,n3)) = f(f(n3,X),u),
inference('PARAMODULATE',[status(thm)],[a1,22,theory(equality)]) ).
cnf(32,plain,
f(n1,f(n1,n3)) != f(f(u,u),u),
inference('REWRITE',[status(thm)],[prove_equation,10,31,theory(equality)]) ).
cnf(34,plain,
f(n1,n3) = f(u,n2),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,clause_2,theory(equality)]),21,theory(equality)]) ).
cnf(45,plain,
f(n2,u) = f(u,u),
inference('PARAMODULATE',[status(thm)],[8,clause_4,theory(equality)]) ).
cnf(46,plain,
$false,
inference('REWRITE',[status(thm)],[32,9,34,14,45,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LDA001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 02:30:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-30T02:30:12
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-05-30T02:30:12
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.50 ||#
% 0.19/0.50
% 0.19/0.50 ; Summary of computation:
% 0.19/0.50 ; 75 formulas have been input or derived (from 14 formulas).
% 0.19/0.50 ; 46 (61%) were retained. Of these,
% 0.19/0.50 ; 3 ( 7%) were simplified or subsumed later,
% 0.19/0.50 ; 43 (93%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.001 3% Read assertion file (1 call)
% 0.19/0.50 ; 0.000 0% Assert (5 calls)
% 0.19/0.50 ; 0.005 13% Process new row (68 calls)
% 0.19/0.50 ; 0.000 0% Resolution (26 calls)
% 0.19/0.50 ; 0.002 5% Paramodulation (13 calls)
% 0.19/0.50 ; 0.001 3% Forward simplification (68 calls)
% 0.19/0.50 ; 0.004 10% Backward simplification (46 calls)
% 0.19/0.50 ; 0.004 10% Ordering (319 calls)
% 0.19/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.50 ; 0.000 0% Purity testing (1 call)
% 0.19/0.50 ; 0.022 56% Other
% 0.19/0.50 ; 0.039 Total
% 0.19/0.50 ; 0.041 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 151 terms in all.
% 0.19/0.50 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.50 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.50 ; Path-index has 146 entries (149 at peak, 157 added, 11 deleted).
% 0.19/0.50 ; Path-index has 138 nodes (138 at peak, 142 added, 4 deleted).
% 0.19/0.50 ; Trie-index has 146 entries (149 at peak, 157 added, 11 deleted).
% 0.19/0.51 ; Trie-index has 564 nodes (573 at peak, 596 added, 32 deleted).
% 0.19/0.51 ; Retrieved 207 generalization terms in 350 calls.
% 0.19/0.51 ; Retrieved 78 instance terms in 59 calls.
% 0.19/0.51 ; Retrieved 157 unifiable terms in 87 calls.
% 0.19/0.51 ;
% 0.19/0.51 ; The agenda of rows to process has 7 entries:
% 0.19/0.51 ; 1 with value 12 1 with value 17 1 with value 23
% 0.19/0.51 ; 1 with value 14 1 with value 21 2 with value 25
% 0.19/0.51 ; The agenda of rows to give has 31 entries:
% 0.19/0.51 ; 1 with value (4 11) 6 with value (4 19) 4 with value (4 25)
% 0.19/0.51 ; 6 with value (4 15) 2 with value (4 23) 2 with value (4 26)
% 0.19/0.51 ; 6 with value (4 17) 4 with value (4 24)
% 0.19/0.51 Evaluation took:
% 0.19/0.51 0.041 seconds of real time
% 0.19/0.51 0.034225 seconds of user run time
% 0.19/0.51 0.007104 seconds of system run time
% 0.19/0.51 0 calls to %EVAL
% 0.19/0.51 0 page faults and
% 0.19/0.51 3,009,456 bytes consed.
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-30T02:30:12
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 *
%------------------------------------------------------------------------------