TSTP Solution File: SYN143-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYN143-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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 : Thu Jul 21 11:58:00 EDT 2022
% Result : Unsatisfiable 0.83s 1.04s
% Output : Refutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 29
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 14 RR)
% Number of literals : 61 ( 60 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 6 con; 0-4 aty)
% Number of variables : 87 ( 34 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_5,axiom,
s0(b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
cnf(axiom_14,axiom,
p0(b,X) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).
cnf(axiom_17,axiom,
q0(X,d) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17) ).
cnf(axiom_19,axiom,
m0(X,d,Y) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).
cnf(axiom_20,axiom,
l0(a) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_20) ).
cnf(axiom_32,axiom,
k0(b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_32) ).
cnf(axiom_34,axiom,
n0(c,d) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_34) ).
cnf(axiom_37,axiom,
n0(b,a) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_37) ).
cnf(rule_002,axiom,
ifeq(n0(X,Y),true,l1(Y,Y),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_002) ).
cnf(rule_050,axiom,
ifeq(l0(X),true,ifeq(p0(b,Y),true,ifeq(s0(b),true,n1(X,Y,X),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_050) ).
cnf(98,plain,
ifeq(l0(X),true,n1(X,Y,X),true) = true,
inference('REWRITE',[status(thm)],[rule_050,ifeq_axiom,axiom_5,axiom_14,theory(equality)]) ).
cnf(rule_054,axiom,
ifeq(n1(X,Y,X),true,ifeq(l0(Z),true,ifeq(l1(Z,X),true,n1(X,Y,Y),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_054) ).
cnf(rule_069,axiom,
ifeq(p0(X,Y),true,p1(Y,Y,X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_069) ).
cnf(rule_085,axiom,
ifeq(p0(X,Y),true,p1(Y,Y,Y),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_085) ).
cnf(rule_110,axiom,
ifeq(m0(X,Y,Z),true,q1(Z,Z,Z),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_110) ).
cnf(rule_125,axiom,
ifeq(p0(X,X),true,s1(X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_125) ).
cnf(rule_126,axiom,
ifeq(s1(X),true,ifeq(q0(Y,Z),true,s1(Y),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_126) ).
cnf(rule_133,axiom,
ifeq(s1(X),true,ifeq(p0(Y,Y),true,ifeq(m0(Z,X,U),true,l2(U,U),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_133) ).
cnf(rule_154,axiom,
ifeq(q1(X,X,X),true,p2(X,X,X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_154) ).
cnf(rule_177,axiom,
ifeq(p1(X,X,X),true,ifeq(k0(Y),true,q2(X,Y,Y),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_177) ).
cnf(rule_182,axiom,
ifeq(q2(X,Y,Z),true,ifeq(p1(Z,Z,Y),true,ifeq(n1(X,Z,Y),true,q2(Z,X,Z),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_182) ).
cnf(rule_189,axiom,
ifeq(q2(b,X,b),true,ifeq(s1(b),true,s2(X),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_189) ).
cnf(rule_240,axiom,
ifeq(p2(X,Y,Z),true,n3(Z),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_240) ).
cnf(rule_248,axiom,
ifeq(n3(X),true,ifeq(p2(Y,X,X),true,p3(X,X,X),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_248) ).
cnf(rule_273,axiom,
ifeq(s2(X),true,ifeq(q2(Y,X,Y),true,ifeq(m0(Y,Z,U),true,s3(X,U),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_273) ).
cnf(rule_279,axiom,
ifeq(s3(a,X),true,ifeq(l2(Y,Z),true,m4(X,Z),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_279) ).
cnf(rule_299,axiom,
ifeq(p3(X,Y,Z),true,ifeq(l1(U,Y),true,s4(U),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_299) ).
cnf(rule_305,axiom,
ifeq(s4(X),true,ifeq(m4(e,e),true,m5(X,X),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_305) ).
cnf(prove_this,negated_conjecture,
m5(d,d) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(419,plain,
s1(b) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_125,axiom_14,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(420,plain,
ifeq(q2(b,X,b),true,s2(X),true) = true,
inference('REWRITE',[status(thm)],[rule_189,ifeq_axiom,419,theory(equality)]) ).
cnf(424,plain,
l1(a,a) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_002,axiom_37,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(427,plain,
l1(d,d) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_002,axiom_34,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(435,plain,
n1(a,X,a) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[98,axiom_20,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(456,plain,
p1(X,X,b) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_069,axiom_14,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(460,plain,
p1(X,X,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_085,axiom_14,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(476,plain,
ifeq(k0(X),true,q2(Y,X,X),true) = true,
inference('REWRITE',[status(thm)],[rule_177,ifeq_axiom,460,theory(equality)]) ).
cnf(482,plain,
q2(X,b,b) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[476,axiom_32,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(513,plain,
q1(X,X,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_110,axiom_19,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(515,plain,
p2(X,X,X) = true,
inference('REWRITE',[status(thm)],[rule_154,ifeq_axiom,513,theory(equality)]) ).
cnf(538,plain,
n3(X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_240,515,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(541,plain,
ifeq(p2(X,Y,Y),true,p3(Y,Y,Y),true) = true,
inference('REWRITE',[status(thm)],[rule_248,ifeq_axiom,538,theory(equality)]) ).
cnf(565,plain,
p3(X,X,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[541,515,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(572,plain,
ifeq(s1(X),true,s1(Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_126,axiom_17,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(742,plain,
ifeq(s1(d),true,ifeq(p0(X,X),true,l2(Y,Y),true),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_133,axiom_19,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(873,plain,
n1(a,X,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_054,424,theory(equality)]),ifeq_axiom,axiom_20,435,theory(equality)]) ).
cnf(915,plain,
ifeq(n1(X,b,b),true,q2(b,X,b),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_182,482,theory(equality)]),ifeq_axiom,456,theory(equality)]) ).
cnf(969,plain,
ifeq(l1(X,Y),true,s4(X),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_299,565,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1046,plain,
s1(X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[572,419,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1071,plain,
ifeq(p0(X,X),true,l2(Y,Y),true) = true,
inference('REWRITE',[status(thm)],[742,ifeq_axiom,1046,theory(equality)]) ).
cnf(1318,plain,
s4(d) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[969,427,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1343,plain,
ifeq(m4(e,e),true,m5(d,d),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_305,1318,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1347,plain,
l2(X,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1071,axiom_14,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1369,plain,
ifeq(s3(a,X),true,m4(X,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_279,1347,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1672,plain,
q2(b,a,b) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[915,873,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1673,plain,
s2(a) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[420,1672,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1675,plain,
ifeq(m0(b,X,Y),true,s3(a,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_273,1672,theory(equality)]),ifeq_axiom,1673,theory(equality)]) ).
cnf(1750,plain,
s3(a,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1675,axiom_19,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1752,plain,
m4(X,Y) = true,
inference('REWRITE',[status(thm)],[1369,ifeq_axiom,1750,theory(equality)]) ).
cnf(1766,plain,
$false,
inference('REWRITE',[status(thm)],[1343,prove_this,ifeq_axiom,1752,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN143-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 02:36:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-12T02:36:10
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-07-12T02:36:10
% 0.83/1.04
% 0.83/1.04
% 0.83/1.04 #||
% 0.83/1.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.83/1.04 % SZS output start Refutation
% See solution above
% 0.83/1.05 ||#
% 0.83/1.05
% 0.83/1.05 ; Summary of computation:
% 0.83/1.05 ; 7068 formulas have been input or derived (from 975 formulas).
% 0.83/1.05 ; 1766 (25%) were retained. Of these,
% 0.83/1.05 ; 956 (54%) were simplified or subsumed later,
% 0.83/1.05 ; 810 (46%) are still being kept.
% 0.83/1.05 ;
% 0.83/1.05 ; Run time in seconds excluding printing time:
% 0.83/1.05 ; 0.076 13% Read assertion file (1 call)
% 0.83/1.05 ; 0.007 1% Assert (363 calls)
% 0.83/1.05 ; 0.148 26% Process new row (6,434 calls)
% 0.83/1.05 ; 0.016 3% Resolution (1,948 calls)
% 0.83/1.05 ; 0.093 16% Paramodulation (974 calls)
% 0.83/1.05 ; 0.080 14% Forward simplification (6,349 calls)
% 0.83/1.05 ; 0.093 16% Backward simplification (1,715 calls)
% 0.83/1.05 ; 0.014 2% Ordering (12,853 calls)
% 0.83/1.05 ; 0.000 0% Sortal reasoning (32 calls)
% 0.83/1.05 ; 0.000 0% Purity testing (1 call)
% 0.83/1.05 ; 0.048 8% Other
% 0.83/1.05 ; 0.575 Total
% 0.83/1.05 ; 0.580 Real time
% 0.83/1.05 ;
% 0.83/1.05 ; Term-hash-array has 5,123 terms in all.
% 0.83/1.05 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.83/1.05 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.83/1.05 ; Path-index has 2,493 entries (2,789 at peak, 5,491 added, 2,998 deleted).
% 0.83/1.05 ; Path-index has 4,014 nodes (4,188 at peak, 6,306 added, 2,292 deleted).
% 0.83/1.05 ; Trie-index has 2,493 entries (2,789 at peak, 5,491 added, 2,998 deleted).
% 0.83/1.05 ; Trie-index has 11,520 nodes (12,799 at peak, 27,880 added, 16,360 deleted).
% 0.83/1.05 ; Retrieved 14,009 generalization terms in 22,165 calls.
% 0.83/1.05 ; Retrieved 2,767 instance terms in 1,714 calls.
% 0.83/1.05 ; Retrieved 9,937 unifiable terms in 7,083 calls.
% 0.83/1.05 ;
% 0.83/1.05 ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.83/1.05 ; 3 with value 0
% 0.83/1.05 ; The agenda of rows to process has 1 entry:
% 0.83/1.05 ; 1 with value 24
% 0.83/1.05 ; The agenda of input rows to give has 2 entries:
% 0.83/1.05 ; 1 with value 13 1 with value 23
% 0.83/1.05 ; The agenda of rows to give has 183 entries:
% 0.83/1.05 ; 1 with value (4 10) 14 with value (4 22) 2 with value (4 30)
% 0.83/1.05 ; 1 with value (4 11) 26 with value (4 23) 1 with value (4 31)
% 0.83/1.05 ; 2 with value (4 12) 25 with value (4 24) 2 with value (4 32)
% 0.83/1.05 ; 4 with value (4 13) 18 with value (4 25) 3 with value (4 33)
% 0.83/1.05 ; 4 with value (4 18) 15 with value (4 26) 1 with value (4 34)
% 0.83/1.05 ; 7 with value (4 19) 14 with value (4 27) 4 with value (4 35)
% 0.83/1.05 ; 21 with value (4 20) 1 with value (4 28) 3 with value (4 36)
% 0.83/1.05 ; 11 with value (4 21) 3 with value (4 29)
% 0.83/1.05 Evaluation took:
% 0.83/1.05 0.58 seconds of real time
% 0.83/1.05 0.522361 seconds of user run time
% 0.83/1.05 0.057856 seconds of system run time
% 0.83/1.05 [Run times include 0.04 seconds GC run time.]
% 0.83/1.05 0 calls to %EVAL
% 0.83/1.05 0 page faults and
% 0.83/1.05 46,053,864 bytes consed.
% 0.83/1.05 :PROOF-FOUND
% 0.83/1.05 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-12T02:36:10
% 0.83/1.05 :PROOF-FOUND
% 0.83/1.05 *
%------------------------------------------------------------------------------