%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : CSR013+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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:17:59 EDT 2022
% Result : Theorem 1.10s 1.33s
% Output : Refutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 33
% Syntax : Number of clauses : 71 ( 40 unt; 10 nHn; 66 RR)
% Number of literals : 121 ( 32 equ; 58 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 67 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ stoppedIn(X,Y,Z)
| happens('SKOLEMAAAX1'(X,Z,Y),'SKOLEMAAAX2'(X,Z,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).
cnf(2,axiom,
( ~ stoppedIn(X,Y,Z)
| less(X,'SKOLEMAAAX2'(X,Z,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).
cnf(3,axiom,
( ~ stoppedIn(X,Y,Z)
| less('SKOLEMAAAX2'(X,Z,Y),Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).
cnf(11,axiom,
( ~ happens(X,Y)
| ~ initiates(X,Z,Y)
| ~ less(n0,U)
| ~ trajectory(Z,Y,V,U)
| stoppedIn(Y,Z,plus(Y,U))
| holdsAt(V,plus(Y,U)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',change_holding) ).
cnf(20,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(21,axiom,
( ~ happens(X,Y)
| ~ terminates(X,Z,Y)
| ~ holdsAt(Z,plus(Y,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
cnf(43,axiom,
( initiates(X,Y,Z)
| X != tapOn
| Y != filling ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',initiates_all_defn) ).
cnf(51,axiom,
( terminates(X,Y,Z)
| X != overflow
| Y != filling ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',terminates_all_defn) ).
cnf(55,axiom,
( ~ happens(X,Y)
| X = tapOn
| holdsAt(waterLevel(n3),Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
cnf(58,axiom,
( ~ happens(X,Y)
| Y = n0
| holdsAt(waterLevel(n3),Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
cnf(59,axiom,
( ~ happens(X,Y)
| Y = n0
| holdsAt(filling,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
cnf(60,axiom,
( ~ happens(X,Y)
| Y = n0
| X = overflow ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
cnf(61,axiom,
( happens(X,Y)
| X != tapOn
| Y != n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
cnf(62,axiom,
( happens(X,Y)
| ~ holdsAt(waterLevel(n3),Y)
| ~ holdsAt(filling,Y)
| X != overflow ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
cnf(63,axiom,
( ~ holdsAt(waterLevel(X),Y)
| Z != plus(X,U)
| trajectory(filling,Y,waterLevel(Z),U) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',change_of_waterLevel) ).
cnf(64,axiom,
( ~ holdsAt(waterLevel(X),Y)
| ~ holdsAt(waterLevel(Z),Y)
| X = Z ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',same_waterLevel) ).
cnf(67,axiom,
overflow != tapOn,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',overflow_not_tapOn) ).
cnf(74,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
cnf(75,axiom,
plus(n0,n2) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_2) ).
cnf(77,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).
cnf(83,axiom,
( ~ less_or_equal(X,Y)
| less(X,Y)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
cnf(84,axiom,
( less_or_equal(X,Y)
| ~ less(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
cnf(85,axiom,
( less_or_equal(X,Y)
| X != Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
cnf(86,axiom,
~ less(X,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less0) ).
cnf(87,axiom,
( ~ less(X,n1)
| less_or_equal(X,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).
cnf(88,axiom,
( less(X,n1)
| ~ less_or_equal(X,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).
cnf(89,axiom,
( ~ less(X,n2)
| less_or_equal(X,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
cnf(90,axiom,
( less(X,n2)
| ~ less_or_equal(X,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
cnf(92,axiom,
( less(X,n3)
| ~ less_or_equal(X,n2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).
cnf(105,axiom,
( ~ less(X,Y)
| ~ less(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
cnf(106,axiom,
( ~ less(X,Y)
| X != Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
cnf(108,hypothesis,
holdsAt(waterLevel(n0),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_0) ).
cnf(114,negated_conjecture,
happens('SKOLEMAAAX12',n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nothing_terminates_filling_2) ).
cnf(116,plain,
less_or_equal(X,X),
inference('HYPERRESOLVE',[status(thm)],[85,theory(equality)]) ).
cnf(133,plain,
( n2 = n0
| holdsAt(filling,n2) ),
inference('HYPERRESOLVE',[status(thm)],[59,114]) ).
cnf(134,plain,
( n2 = n0
| 'SKOLEMAAAX12' = overflow ),
inference('HYPERRESOLVE',[status(thm)],[60,114]) ).
cnf(135,plain,
happens(tapOn,n0),
inference('HYPERRESOLVE',[status(thm)],[61,theory(equality),theory(equality)]) ).
cnf(149,plain,
initiates(tapOn,filling,X),
inference('HYPERRESOLVE',[status(thm)],[43,theory(equality),theory(equality)]) ).
cnf(154,plain,
terminates(overflow,filling,X),
inference('HYPERRESOLVE',[status(thm)],[51,theory(equality),theory(equality)]) ).
cnf(157,plain,
( 'SKOLEMAAAX12' = tapOn
| holdsAt(waterLevel(n3),n2) ),
inference('HYPERRESOLVE',[status(thm)],[55,114]) ).
cnf(162,plain,
( ~ happens(X,n1)
| ~ terminates(X,Y,n1)
| ~ holdsAt(Y,n2) ),
inference('PARAMODULATE',[status(thm)],[21,77,theory(equality)]) ).
cnf(188,plain,
trajectory(filling,n0,waterLevel(n2),n2),
inference('HYPERRESOLVE',[status(thm)],[63,108,75]) ).
cnf(226,plain,
less(n2,n3),
inference('HYPERRESOLVE',[status(thm)],[92,116]) ).
cnf(228,plain,
less(n1,n2),
inference('HYPERRESOLVE',[status(thm)],[90,116]) ).
cnf(229,plain,
less(n0,n1),
inference('HYPERRESOLVE',[status(thm)],[88,116]) ).
cnf(241,plain,
holdsAt(filling,n1),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[20,149,135]),74,theory(equality)]) ).
cnf(261,plain,
n2 != n3,
inference('UR-RESOLVE',[status(thm)],[106,226]) ).
cnf(269,plain,
~ less(n2,n1),
inference('UR-RESOLVE',[status(thm)],[105,228]) ).
cnf(272,plain,
less_or_equal(n0,n1),
inference('HYPERRESOLVE',[status(thm)],[84,229]) ).
cnf(273,plain,
n0 != n1,
inference('UR-RESOLVE',[status(thm)],[106,229]) ).
cnf(303,plain,
~ less_or_equal(n2,n0),
inference('UR-RESOLVE',[status(thm)],[88,269]) ).
cnf(304,plain,
less(n0,n2),
inference('HYPERRESOLVE',[status(thm)],[90,272]) ).
cnf(347,plain,
n2 != n0,
inference('UR-RESOLVE',[status(thm)],[85,303]) ).
cnf(348,plain,
holdsAt(filling,n2),
inference('REWRITE',[status(thm)],[133,347]) ).
cnf(349,plain,
'SKOLEMAAAX12' = overflow,
inference('REWRITE',[status(thm)],[134,347]) ).
cnf(351,plain,
holdsAt(waterLevel(n3),n2),
inference('REWRITE',[status(thm)],[157,67,349,theory(equality)]) ).
cnf(369,plain,
~ holdsAt(waterLevel(n2),n2),
inference('UR-RESOLVE',[status(thm)],[64,351,261]) ).
cnf(399,plain,
stoppedIn(n0,filling,n2),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,188,135,149,304]),369,75,theory(equality)]) ).
cnf(490,plain,
less('SKOLEMAAAX2'(n0,n2,filling),n2),
inference('HYPERRESOLVE',[status(thm)],[3,399]) ).
cnf(491,plain,
less(n0,'SKOLEMAAAX2'(n0,n2,filling)),
inference('HYPERRESOLVE',[status(thm)],[2,399]) ).
cnf(492,plain,
happens('SKOLEMAAAX1'(n0,n2,filling),'SKOLEMAAAX2'(n0,n2,filling)),
inference('HYPERRESOLVE',[status(thm)],[1,399]) ).
cnf(811,plain,
~ happens(overflow,n1),
inference('UR-RESOLVE',[status(thm)],[162,154,348]) ).
cnf(812,plain,
~ holdsAt(waterLevel(n3),n1),
inference('UR-RESOLVE',[status(thm)],[62,811,241,theory(equality)]) ).
cnf(813,plain,
~ happens(X,n1),
inference('UR-RESOLVE',[status(thm)],[58,812,273]) ).
cnf(870,plain,
less_or_equal('SKOLEMAAAX2'(n0,n2,filling),n1),
inference('HYPERRESOLVE',[status(thm)],[89,490]) ).
cnf(889,plain,
n0 != 'SKOLEMAAAX2'(n0,n2,filling),
inference('UR-RESOLVE',[status(thm)],[106,491]) ).
cnf(1385,plain,
( less('SKOLEMAAAX2'(n0,n2,filling),n1)
| 'SKOLEMAAAX2'(n0,n2,filling) = n1 ),
inference('HYPERRESOLVE',[status(thm)],[83,870]) ).
cnf(1389,plain,
~ less_or_equal('SKOLEMAAAX2'(n0,n2,filling),n0),
inference('UR-RESOLVE',[status(thm)],[83,889,86]) ).
cnf(2023,plain,
~ less('SKOLEMAAAX2'(n0,n2,filling),n1),
inference('UR-RESOLVE',[status(thm)],[87,1389]) ).
cnf(2024,plain,
'SKOLEMAAAX2'(n0,n2,filling) = n1,
inference('REWRITE',[status(thm)],[1385,2023]) ).
cnf(2025,plain,
$false,
inference('REWRITE',[status(thm)],[492,813,2024,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : CSR013+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.16 % Command : run-snark %s %d
% 0.13/0.37 % Computer : n026.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 600
% 0.13/0.37 % DateTime : Fri Jun 10 08:27:18 EDT 2022
% 0.13/0.37 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.51 #<PACKAGE "SNARK-USER">
% 0.21/0.51 *
% 0.21/0.51 SNARK-TPTP-OPTIONS
% 0.21/0.51 *
% 0.21/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.51 (USE-FACTORING :POS)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.51 *
% 0.21/0.51 "."
% 0.21/0.51 *
% 0.21/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-10T08:27:18
% 0.21/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-10T08:27:18
% 0.21/0.54
% 0.21/0.54 ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.21/0.54 WARNING:
% 0.21/0.54 |antitrajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 1.10/1.33 ; Declaring plus to be commutative.
% 1.10/1.33
% 1.10/1.33 #||
% 1.10/1.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.10/1.33 % SZS output start Refutation
% See solution above
% 1.10/1.34 ||#
% 1.10/1.34
% 1.10/1.34 ; Summary of computation:
% 1.10/1.34 ; 9913 formulas have been input or derived (from 1017 formulas).
% 1.10/1.34 ; 2025 (20%) were retained. Of these,
% 1.10/1.34 ; 351 (17%) were simplified or subsumed later,
% 1.10/1.34 ; 1674 (83%) are still being kept.
% 1.10/1.34 ;
% 1.10/1.34 ; Run time in seconds excluding printing time:
% 1.10/1.34 ; 0.012 1% Read assertion file (1 call)
% 1.10/1.34 ; 0.004 0% Assert (55 calls)
% 1.10/1.34 ; 0.120 15% Process new row (8,390 calls)
% 1.10/1.34 ; 0.320 40% Resolution (2,032 calls)
% 1.10/1.34 ; 0.035 4% Paramodulation (1,016 calls)
% 1.10/1.34 ; 0.000 0% Factoring (77 calls)
% 1.10/1.34 ; 0.008 1% Condensing (1,200 calls)
% 1.10/1.34 ; 0.053 7% Forward subsumption (1,200 calls)
% 1.10/1.34 ; 0.014 2% Backward subsumption (628 calls)
% 1.10/1.34 ; 0.007 1% Clause clause subsumption (1,225 calls)
% 1.10/1.34 ; 0.108 13% Forward simplification (7,500 calls)
% 1.10/1.34 ; 0.034 4% Backward simplification (2,025 calls)
% 1.10/1.34 ; 0.015 2% Ordering (9,843 calls)
% 1.10/1.34 ; 0.000 0% Sortal reasoning (32 calls)
% 1.10/1.34 ; 0.001 0% Purity testing (1 call)
% 1.10/1.34 ; 0.076 9% Other
% 1.10/1.34 ; 0.807 Total
% 1.10/1.34 ; 0.826 Real time
% 1.10/1.34 ;
% 1.10/1.34 ; Term-hash-array has 2,203 terms in all.
% 1.10/1.34 ; Feature-vector-row-index has 443 entries (454 at peak, 628 added, 185 deleted).
% 1.10/1.34 ; Feature-vector-row-index has 2,659 nodes (2,744 at peak, 3,886 added, 1,227 deleted).
% 1.10/1.34 ; Retrieved 1,992 possibly forward subsuming rows in 1,200 calls.
% 1.10/1.34 ; Retrieved 217 possibly backward subsumed rows in 628 calls.
% 1.10/1.34 ; Path-index has 1,957 entries (2,068 at peak, 2,287 added, 330 deleted).
% 1.10/1.34 ; Path-index has 1,542 nodes (1,613 at peak, 1,772 added, 230 deleted).
% 1.10/1.34 ; Trie-index has 1,957 entries (2,068 at peak, 2,287 added, 330 deleted).
% 1.10/1.34 ; Trie-index has 4,655 nodes (5,091 at peak, 5,681 added, 1,026 deleted).
% 1.10/1.34 ; Retrieved 10,284 generalization terms in 20,049 calls.
% 1.10/1.34 ; Retrieved 1,445 instance terms in 1,396 calls.
% 1.10/1.34 ; Retrieved 211,965 unifiable terms in 28,809 calls.
% 1.10/1.34 ;
% 1.10/1.34 ; The agenda of backward simplifiable rows to process has 86 entries:
% 1.10/1.34 ; 86 with value 0
% 1.10/1.34 ; The agenda of rows to process has 3 entries:
% 1.10/1.34 ; 1 with value 17 2 with value 25
% 1.10/1.34 ; The agenda of rows to give has 748 entries:
% 1.10/1.34 ; 107 with value (4 16) 25 with value (4 22) 4 with value (4 30)
% 1.10/1.34 ; 146 with value (4 17) 32 with value (4 23) 1 with value (4 32)
% 1.10/1.34 ; 84 with value (4 18) 37 with value (4 24) 10 with value (4 37)
% 1.10/1.34 ; 92 with value (4 19) 10 with value (4 25) 4 with value (4 38)
% 1.10/1.34 ; 77 with value (4 20) 36 with value (4 26) 2 with value (4 39)
% 1.10/1.34 ; 32 with value (4 21) 9 with value (4 28) 40 with value (4 42)
% 1.10/1.34 Evaluation took:
% 1.10/1.34 0.827 seconds of real time
% 1.10/1.34 0.736357 seconds of user run time
% 1.10/1.34 0.076012 seconds of system run time
% 1.10/1.34 [Run times include 0.034 seconds GC run time.]
% 1.10/1.34 0 calls to %EVAL
% 1.10/1.34 0 page faults and
% 1.10/1.34 48,045,504 bytes consed.
% 1.10/1.34 :PROOF-FOUND
% 1.10/1.34 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-10T08:27:19
% 1.10/1.34 :PROOF-FOUND
% 1.10/1.34 *
%------------------------------------------------------------------------------