TSTP Solution File: LCL116-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL116-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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 14:20:21 EDT 2022
% Result : Unsatisfiable 0.47s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 3 RR)
% Number of literals : 29 ( 28 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wajsberg_1,axiom,
implies(truth,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(wajsberg_2,axiom,
implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(wajsberg_3,axiom,
implies(implies(X,Y),Y) = implies(implies(Y,X),X),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(wajsberg_4,axiom,
implies(implies(not(X),not(Y)),implies(Y,X)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(prove_mv_50,negated_conjecture,
implies(not(a),implies(b,not(implies(b,a)))) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_50) ).
cnf(6,plain,
implies(X,X) = implies(implies(X,truth),truth),
inference('PARAMODULATE',[status(thm)],[wajsberg_3,wajsberg_1,theory(equality)]) ).
cnf(8,plain,
implies(implies(not(X),not(truth)),X) = truth,
inference('PARAMODULATE',[status(thm)],[wajsberg_4,wajsberg_1,theory(equality)]) ).
cnf(12,plain,
implies(X,implies(implies(X,Y),Y)) = truth,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_2,wajsberg_1,theory(equality)]),wajsberg_1,theory(equality)]) ).
cnf(13,plain,
implies(implies(X,truth),implies(Y,implies(X,Y))) = truth,
inference('PARAMODULATE',[status(thm)],[wajsberg_2,wajsberg_1,theory(equality)]) ).
cnf(36,plain,
truth = implies(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_1,12,theory(equality)]),wajsberg_1,theory(equality)]) ).
cnf(38,plain,
truth = implies(implies(X,truth),truth),
inference('REWRITE',[status(thm)],[6,36,theory(equality)]) ).
cnf(51,plain,
implies(X,truth) = truth,
inference('PARAMODULATE',[status(thm)],[12,38,theory(equality)]) ).
cnf(52,plain,
implies(X,implies(Y,X)) = truth,
inference('REWRITE',[status(thm)],[13,wajsberg_1,51,theory(equality)]) ).
cnf(55,plain,
implies(implies(implies(X,Y),Z),implies(Y,Z)) = truth,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_2,52,theory(equality)]),wajsberg_1,theory(equality)]) ).
cnf(74,plain,
implies(not(truth),X) = truth,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[55,8,theory(equality)]),wajsberg_1,theory(equality)]) ).
cnf(77,plain,
implies(not(X),implies(X,Y)) = truth,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[55,wajsberg_4,theory(equality)]),wajsberg_1,theory(equality)]) ).
cnf(86,plain,
X = implies(implies(X,not(truth)),not(truth)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_3,74,theory(equality)]),wajsberg_1,theory(equality)]) ).
cnf(113,plain,
implies(not(implies(X,not(truth))),X) = truth,
inference('PARAMODULATE',[status(thm)],[77,86,theory(equality)]) ).
cnf(115,plain,
implies(implies(X,implies(Y,not(truth))),implies(Y,implies(X,not(truth)))) = truth,
inference('PARAMODULATE',[status(thm)],[wajsberg_2,86,theory(equality)]) ).
cnf(154,plain,
implies(X,implies(not(X),not(truth))) = truth,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_4,113,theory(equality)]),wajsberg_1,theory(equality)]) ).
cnf(161,plain,
implies(not(X),not(truth)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_3,154,theory(equality)]),8,wajsberg_1,theory(equality)]) ).
cnf(162,plain,
not(X) = implies(X,not(truth)),
inference('PARAMODULATE',[status(thm)],[86,161,theory(equality)]) ).
cnf(165,plain,
X = not(not(X)),
inference('REWRITE',[status(thm)],[86,162,theory(equality)]) ).
cnf(166,plain,
implies(implies(X,not(Y)),implies(Y,not(X))) = truth,
inference('REWRITE',[status(thm)],[115,162,theory(equality)]) ).
cnf(303,plain,
implies(X,not(Y)) = implies(Y,not(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_3,166,theory(equality)]),166,wajsberg_1,theory(equality)]) ).
cnf(304,plain,
implies(not(a),implies(implies(b,a),not(b))) != truth,
inference('REWRITE',[status(thm)],[prove_mv_50,303,theory(equality)]) ).
cnf(305,plain,
implies(X,Y) = implies(not(Y),not(X)),
inference('PARAMODULATE',[status(thm)],[303,165,theory(equality)]) ).
cnf(332,plain,
implies(not(X),implies(implies(Y,X),not(Y))) = truth,
inference('PARAMODULATE',[status(thm)],[12,305,theory(equality)]) ).
cnf(333,plain,
$false,
inference('REWRITE',[status(thm)],[304,332,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL116-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 4 04:38:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 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.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T04:38:26
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-07-04T04:38:26
% 0.20/0.48
% 0.47/0.63 ; Recognized left identity assertion (= (|implies| |truth| ?X) ?X).
% 0.47/0.63
% 0.47/0.63 #||
% 0.47/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63 % SZS output start Refutation
% See solution above
% 0.47/0.64 ||#
% 0.47/0.64
% 0.47/0.64 ; Summary of computation:
% 0.47/0.64 ; 2758 formulas have been input or derived (from 51 formulas).
% 0.47/0.64 ; 333 (12%) were retained. Of these,
% 0.47/0.64 ; 126 (38%) were simplified or subsumed later,
% 0.47/0.64 ; 207 (62%) are still being kept.
% 0.47/0.64 ;
% 0.47/0.64 ; Run time in seconds excluding printing time:
% 0.47/0.64 ; 0.002 1% Read assertion file (1 call)
% 0.47/0.64 ; 0.000 0% Assert (5 calls)
% 0.47/0.64 ; 0.033 20% Process new row (2,418 calls)
% 0.47/0.64 ; 0.002 1% Resolution (100 calls)
% 0.47/0.64 ; 0.030 18% Paramodulation (50 calls)
% 0.47/0.64 ; 0.065 39% Forward simplification (2,363 calls)
% 0.47/0.64 ; 0.010 6% Backward simplification (333 calls)
% 0.47/0.64 ; 0.008 5% Ordering (4,996 calls)
% 0.47/0.64 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.64 ; 0.000 0% Purity testing (1 call)
% 0.47/0.64 ; 0.017 10% Other
% 0.47/0.65 ; 0.167 Total
% 0.47/0.65 ; 0.177 Real time
% 0.47/0.65 ;
% 0.47/0.65 ; Term-hash-array has 1,037 terms in all.
% 0.47/0.65 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.47/0.65 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.47/0.65 ; Path-index has 678 entries (700 at peak, 1,074 added, 396 deleted).
% 0.47/0.65 ; Path-index has 690 nodes (716 at peak, 981 added, 291 deleted).
% 0.47/0.65 ; Trie-index has 678 entries (700 at peak, 1,074 added, 396 deleted).
% 0.47/0.65 ; Trie-index has 2,120 nodes (2,250 at peak, 3,756 added, 1,636 deleted).
% 0.47/0.65 ; Retrieved 19,089 generalization terms in 14,497 calls.
% 0.47/0.65 ; Retrieved 976 instance terms in 341 calls.
% 0.47/0.65 ; Retrieved 6,474 unifiable terms in 353 calls.
% 0.47/0.65 ;
% 0.47/0.65 ; The agenda of rows to process has 33 entries:
% 0.47/0.65 ; 1 with value 23 6 with value 26 2 with value 29
% 0.47/0.65 ; 7 with value 24 3 with value 27 2 with value 30
% 0.47/0.65 ; 4 with value 25 8 with value 28
% 0.47/0.65 ; The agenda of rows to give has 173 entries:
% 0.47/0.65 ; 4 with value (4 20) 26 with value (4 25) 3 with value (4 30)
% 0.47/0.65 ; 5 with value (4 21) 28 with value (4 26) 4 with value (4 31)
% 0.47/0.65 ; 13 with value (4 22) 23 with value (4 27) 2 with value (4 32)
% 0.47/0.65 ; 26 with value (4 23) 11 with value (4 28) 1 with value (4 35)
% 0.47/0.65 ; 24 with value (4 24) 3 with value (4 29)
% 0.47/0.65 Evaluation took:
% 0.47/0.65 0.177 seconds of real time
% 0.47/0.65 0.148354 seconds of user run time
% 0.47/0.65 0.029092 seconds of system run time
% 0.47/0.65 [Run times include 0.007 seconds GC run time.]
% 0.47/0.65 0 calls to %EVAL
% 0.47/0.65 0 page faults and
% 0.47/0.65 13,892,672 bytes consed.
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T04:38:26
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 *
%------------------------------------------------------------------------------