TSTP Solution File: LCL188-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL188-1 : TPTP v8.1.0. Released v1.1.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 14:20:54 EDT 2022
% Result : Unsatisfiable 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 6 RR)
% Number of literals : 16 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
axiom(or(not(or(X,X)),X)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X),or(Y,X))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(rule_1,axiom,
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(rule_2,axiom,
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(rule_3,axiom,
( theorem(or(not(X),Y))
| ~ axiom(or(not(X),Z))
| ~ theorem(or(not(Z),Y)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(p,or(not(or(p,q)),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(11,plain,
theorem(or(not(or(X,X)),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).
cnf(17,plain,
~ theorem(or(not(or(p,q)),or(p,q))),
inference('UR-RESOLVE',[status(thm)],[rule_2,axiom_1_5,prove_this]) ).
cnf(30,plain,
theorem(or(not(X),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_3,11,axiom_1_3]) ).
cnf(31,plain,
$false,
inference('REWRITE',[status(thm)],[17,30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL188-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 4 18:00:36 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.48 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49 *
% 0.21/0.49 *
% 0.21/0.50 #<PACKAGE "SNARK-USER">
% 0.21/0.50 *
% 0.21/0.50 SNARK-TPTP-OPTIONS
% 0.21/0.50 *
% 0.21/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50 (USE-FACTORING :POS)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50 *
% 0.21/0.50 "."
% 0.21/0.50 *
% 0.21/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T18:00:36
% 0.21/0.50 ; 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-07-04T18:00:36
% 0.21/0.53
% 0.21/0.53
% 0.21/0.53 #||
% 0.21/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.53 % SZS output start Refutation
% See solution above
% 0.21/0.53 ||#
% 0.21/0.53
% 0.21/0.53 ; Summary of computation:
% 0.21/0.53 ; 61 formulas have been input or derived (from 12 formulas).
% 0.21/0.53 ; 31 (51%) were retained. Of these,
% 0.21/0.53 ; 1 ( 3%) were simplified or subsumed later,
% 0.21/0.53 ; 30 (97%) are still being kept.
% 0.21/0.53 ;
% 0.21/0.53 ; Run time in seconds excluding printing time:
% 0.21/0.53 ; 0.002 6% Read assertion file (1 call)
% 0.21/0.53 ; 0.001 3% Assert (9 calls)
% 0.21/0.53 ; 0.001 3% Process new row (36 calls)
% 0.21/0.53 ; 0.002 6% Resolution (22 calls)
% 0.21/0.53 ; 0.000 0% Paramodulation (11 calls)
% 0.21/0.53 ; 0.000 0% Condensing (3 calls)
% 0.21/0.53 ; 0.000 0% Forward subsumption (3 calls)
% 0.21/0.53 ; 0.000 0% Backward subsumption (3 calls)
% 0.21/0.53 ; 0.000 0% Clause clause subsumption (3 calls)
% 0.21/0.53 ; 0.001 3% Forward simplification (36 calls)
% 0.21/0.53 ; 0.001 3% Backward simplification (31 calls)
% 0.21/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.21/0.53 ; 0.000 0% Purity testing (1 call)
% 0.21/0.53 ; 0.024 75% Other
% 0.21/0.53 ; 0.032 Total
% 0.21/0.53 ; 0.033 Real time
% 0.21/0.53 ;
% 0.21/0.53 ; Term-hash-array has 91 terms in all.
% 0.21/0.53 ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 0.21/0.53 ; Feature-vector-row-index has 15 nodes (15 at peak, 15 added, 0 deleted).
% 0.21/0.53 ; Retrieved 3 possibly forward subsuming rows in 3 calls.
% 0.21/0.53 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.21/0.53 ; Path-index has 91 entries (93 at peak, 93 added, 2 deleted).
% 0.21/0.53 ; Path-index has 237 nodes (237 at peak, 237 added, 0 deleted).
% 0.21/0.53 ; Trie-index has 91 entries (93 at peak, 93 added, 2 deleted).
% 0.21/0.53 ; Trie-index has 288 nodes (294 at peak, 294 added, 6 deleted).
% 0.21/0.53 ; Retrieved 61 generalization terms in 33 calls.
% 0.21/0.53 ; Retrieved 56 instance terms in 27 calls.
% 0.21/0.53 ; Retrieved 336 unifiable terms in 123 calls.
% 0.21/0.53 ;
% 0.21/0.53 ; The agenda of rows to process has 14 entries:
% 0.21/0.53 ; 4 with value 13 4 with value 18 1 with value 25
% 0.21/0.53 ; 1 with value 16 4 with value 21
% 0.21/0.53 ; The agenda of rows to give has 18 entries:
% 0.21/0.53 ; 1 with value (4 10) 5 with value (4 15) 1 with value (4 21)
% 0.21/0.53 ; 2 with value (4 12) 2 with value (4 17) 1 with value (4 22)
% 0.21/0.53 ; 1 with value (4 13) 1 with value (4 19) 3 with value (4 25)
% 0.21/0.53 ; 1 with value (4 14)
% 0.21/0.53 Evaluation took:
% 0.21/0.53 0.035 seconds of real time
% 0.21/0.53 0.030011 seconds of user run time
% 0.21/0.53 0.004038 seconds of system run time
% 0.21/0.53 0 calls to %EVAL
% 0.21/0.53 0 page faults and
% 0.21/0.53 2,243,456 bytes consed.
% 0.21/0.53 :PROOF-FOUND
% 0.21/0.53 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T18:00:36
% 0.21/0.53 :PROOF-FOUND
% 0.21/0.53 *
%------------------------------------------------------------------------------