TSTP Solution File: LCL197-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL197-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:21:01 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% 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 : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
axiom(or(not(or(X,X)),X)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(rule_1,axiom,
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(rule_2,axiom,
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(q,or(p,q))),or(p,q))),
file('/export/starexec/sandbox/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(21,plain,
~ theorem(or(not(or(p,or(q,q))),or(p,q))),
inference('UR-RESOLVE',[status(thm)],[rule_3,prove_this,axiom_1_5]) ).
cnf(59,plain,
theorem(or(not(or(X,or(Y,Y))),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,11,axiom_1_6]) ).
cnf(60,plain,
$false,
inference('REWRITE',[status(thm)],[21,59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL197-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n020.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 02:24:00 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-07-03T02:24:00
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-07-03T02:24:00
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 #||
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 98 formulas have been input or derived (from 24 formulas).
% 0.20/0.52 ; 60 (61%) were retained. Of these,
% 0.20/0.52 ; 1 ( 2%) were simplified or subsumed later,
% 0.20/0.52 ; 59 (98%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.003 8% Read assertion file (1 call)
% 0.20/0.52 ; 0.000 0% Assert (9 calls)
% 0.20/0.52 ; 0.006 17% Process new row (73 calls)
% 0.20/0.52 ; 0.003 8% Resolution (46 calls)
% 0.20/0.52 ; 0.001 3% Paramodulation (23 calls)
% 0.20/0.52 ; 0.001 3% Condensing (3 calls)
% 0.20/0.52 ; 0.000 0% Forward subsumption (3 calls)
% 0.20/0.52 ; 0.000 0% Backward subsumption (3 calls)
% 0.20/0.52 ; 0.000 0% Clause clause subsumption (3 calls)
% 0.20/0.52 ; 0.000 0% Forward simplification (73 calls)
% 0.20/0.52 ; 0.000 0% Backward simplification (60 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.022 61% Other
% 0.20/0.52 ; 0.036 Total
% 0.20/0.52 ; 0.038 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 154 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 15 nodes (15 at peak, 15 added, 0 deleted).
% 0.20/0.52 ; Retrieved 3 possibly forward subsuming rows in 3 calls.
% 0.20/0.52 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.20/0.52 ; Path-index has 152 entries (156 at peak, 156 added, 4 deleted).
% 0.20/0.52 ; Path-index has 329 nodes (332 at peak, 332 added, 3 deleted).
% 0.20/0.52 ; Trie-index has 152 entries (156 at peak, 156 added, 4 deleted).
% 0.20/0.52 ; Trie-index has 466 nodes (486 at peak, 486 added, 20 deleted).
% 0.20/0.52 ; Retrieved 101 generalization terms in 70 calls.
% 0.20/0.52 ; Retrieved 105 instance terms in 56 calls.
% 0.20/0.52 ; Retrieved 539 unifiable terms in 234 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to process has 14 entries:
% 0.20/0.52 ; 2 with value 18 5 with value 21 1 with value 23
% 0.20/0.52 ; 1 with value 19 2 with value 22 1 with value 27
% 0.20/0.52 ; 2 with value 20
% 0.20/0.52 ; The agenda of rows to give has 35 entries:
% 0.20/0.52 ; 1 with value (4 10) 3 with value (4 16) 2 with value (4 21)
% 0.20/0.52 ; 1 with value (4 12) 5 with value (4 17) 2 with value (4 22)
% 0.20/0.52 ; 3 with value (4 13) 4 with value (4 18) 1 with value (4 25)
% 0.20/0.52 ; 2 with value (4 14) 3 with value (4 19) 1 with value (4 27)
% 0.20/0.52 ; 4 with value (4 15) 2 with value (4 20) 1 with value (4 29)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.038 seconds of real time
% 0.20/0.52 0.035363 seconds of user run time
% 0.20/0.52 0.003185 seconds of system run time
% 0.20/0.52 0 calls to %EVAL
% 0.20/0.52 0 page faults and
% 0.20/0.52 2,562,968 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T02:24:00
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------