%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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 : Fri Jul 15 23:18:00 EDT 2022
% Result : Theorem 0.21s 0.61s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 23 ( 13 unt; 3 nHn; 20 RR)
% Number of literals : 39 ( 13 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(19,axiom,
( ~ happens(X,Y)
| ~ initiates(X,Z,Y)
| holdsAt(Z,plus(Y,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_holds) ).
cnf(36,axiom,
( initiates(X,Y,Z)
| X != push
| Y != forwards
| happens(pull,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',initiates_all_defn) ).
cnf(57,axiom,
( ~ happens(X,Y)
| X = push
| Y = n1
| Y = n2 ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
cnf(60,axiom,
( happens(X,Y)
| X != push
| Y != n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
cnf(64,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
cnf(69,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
cnf(80,axiom,
( less_or_equal(X,Y)
| X != Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
cnf(83,axiom,
( less(X,n1)
| ~ less_or_equal(X,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).
cnf(85,axiom,
( less(X,n2)
| ~ less_or_equal(X,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
cnf(100,axiom,
( ~ less(X,Y)
| ~ less(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
cnf(101,axiom,
( ~ less(X,Y)
| X != Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
cnf(107,negated_conjecture,
~ holdsAt(forwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forwards_1) ).
cnf(112,plain,
less_or_equal(X,X),
inference('HYPERRESOLVE',[status(thm)],[80,theory(equality)]) ).
cnf(114,plain,
happens(push,n0),
inference('HYPERRESOLVE',[status(thm)],[60,theory(equality),theory(equality)]) ).
cnf(138,plain,
( initiates(push,forwards,X)
| happens(pull,X) ),
inference('HYPERRESOLVE',[status(thm)],[36,theory(equality),theory(equality)]) ).
cnf(160,plain,
less(n1,n2),
inference('HYPERRESOLVE',[status(thm)],[85,112]) ).
cnf(161,plain,
less(n0,n1),
inference('HYPERRESOLVE',[status(thm)],[83,112]) ).
cnf(210,plain,
~ less(n2,n1),
inference('UR-RESOLVE',[status(thm)],[100,160]) ).
cnf(212,plain,
n0 != n1,
inference('UR-RESOLVE',[status(thm)],[101,161]) ).
cnf(244,plain,
~ less_or_equal(n2,n0),
inference('UR-RESOLVE',[status(thm)],[83,210]) ).
cnf(288,plain,
n2 != n0,
inference('UR-RESOLVE',[status(thm)],[80,244]) ).
cnf(325,plain,
~ happens(pull,n0),
inference('UR-RESOLVE',[status(thm)],[57,288,64,212]) ).
cnf(327,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[19,138,114]),107,69,325,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 10 03:29:49 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-10T03:29:49
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-10T03:29:49
% 0.21/0.50
% 0.21/0.50 ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.21/0.50 WARNING:
% 0.21/0.50 |antitrajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 0.21/0.50 WARNING:
% 0.21/0.50 |trajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 0.21/0.61 ; Declaring plus to be commutative.
% 0.21/0.61
% 0.21/0.61 #||
% 0.21/0.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.61 % SZS output start Refutation
% See solution above
% 0.21/0.61 ||#
% 0.21/0.61
% 0.21/0.61 ; Summary of computation:
% 0.21/0.61 ; 1175 formulas have been input or derived (from 221 formulas).
% 0.21/0.61 ; 327 (28%) were retained. Of these,
% 0.21/0.61 ; 13 ( 4%) were simplified or subsumed later,
% 0.21/0.61 ; 314 (96%) are still being kept.
% 0.21/0.61 ;
% 0.21/0.61 ; Run time in seconds excluding printing time:
% 0.21/0.61 ; 0.011 9% Read assertion file (1 call)
% 0.21/0.61 ; 0.005 4% Assert (48 calls)
% 0.21/0.61 ; 0.022 17% Process new row (997 calls)
% 0.21/0.61 ; 0.033 26% Resolution (440 calls)
% 0.21/0.61 ; 0.003 2% Paramodulation (220 calls)
% 0.21/0.61 ; 0.000 0% Factoring (3 calls)
% 0.21/0.61 ; 0.006 5% Condensing (225 calls)
% 0.21/0.61 ; 0.006 5% Forward subsumption (225 calls)
% 0.21/0.61 ; 0.004 3% Backward subsumption (143 calls)
% 0.21/0.61 ; 0.001 1% Clause clause subsumption (120 calls)
% 0.21/0.61 ; 0.010 8% Forward simplification (995 calls)
% 0.21/0.61 ; 0.002 2% Backward simplification (327 calls)
% 0.21/0.61 ; 0.000 0% Ordering (518 calls)
% 0.21/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.21/0.61 ; 0.001 1% Purity testing (1 call)
% 0.21/0.61 ; 0.025 19% Other
% 0.21/0.61 ; 0.129 Total
% 0.21/0.61 ; 0.130 Real time
% 0.21/0.61 ;
% 0.46/0.61 ; Term-hash-array has 366 terms in all.
% 0.46/0.61 ; Feature-vector-row-index has 130 entries (130 at peak, 143 added, 13 deleted).
% 0.46/0.61 ; Feature-vector-row-index has 394 nodes (394 at peak, 472 added, 78 deleted).
% 0.46/0.61 ; Retrieved 164 possibly forward subsuming rows in 225 calls.
% 0.46/0.61 ; Retrieved 54 possibly backward subsumed rows in 143 calls.
% 0.46/0.61 ; Path-index has 371 entries (371 at peak, 389 added, 18 deleted).
% 0.46/0.61 ; Path-index has 430 nodes (430 at peak, 459 added, 29 deleted).
% 0.46/0.61 ; Trie-index has 371 entries (371 at peak, 389 added, 18 deleted).
% 0.46/0.61 ; Trie-index has 634 nodes (634 at peak, 691 added, 57 deleted).
% 0.46/0.61 ; Retrieved 1,013 generalization terms in 1,362 calls.
% 0.46/0.61 ; Retrieved 222 instance terms in 183 calls.
% 0.46/0.61 ; Retrieved 23,344 unifiable terms in 3,247 calls.
% 0.46/0.61 ;
% 0.46/0.61 ; The agenda of rows to process has 49 entries:
% 0.46/0.61 ; 1 with value 13 6 with value 18 6 with value 22
% 0.46/0.61 ; 13 with value 14 1 with value 19 6 with value 23
% 0.46/0.61 ; 2 with value 16 6 with value 20 8 with value 27
% 0.46/0.61 ; The agenda of rows to give has 93 entries:
% 0.46/0.61 ; 42 with value (4 10) 4 with value (4 14) 4 with value (4 17)
% 0.46/0.61 ; 6 with value (4 12) 4 with value (4 15) 6 with value (4 18)
% 0.46/0.61 ; 10 with value (4 13) 14 with value (4 16) 3 with value (4 24)
% 0.46/0.61 Evaluation took:
% 0.46/0.61 0.131 seconds of real time
% 0.46/0.61 0.114233 seconds of user run time
% 0.46/0.61 0.016914 seconds of system run time
% 0.46/0.61 0 calls to %EVAL
% 0.46/0.61 0 page faults and
% 0.46/0.61 7,018,440 bytes consed.
% 0.46/0.61 :PROOF-FOUND
% 0.46/0.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-10T03:29:49
% 0.46/0.61 :PROOF-FOUND
% 0.46/0.61 *
%------------------------------------------------------------------------------