TSTP Solution File: ALG210+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ALG210+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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 14 18:00:11 EDT 2022
% Result : Theorem 0.40s 0.56s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 32 ( 29 unt; 0 nHn; 14 RR)
% Number of literals : 36 ( 28 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
times(times(X,Y),Z) = times(Y,times(Z,X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
cnf(2,axiom,
( ~ element(X)
| times(X,'SKOLEMAAAU1'(X)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
cnf(3,axiom,
( ~ element(X)
| times(X,X) = 'SKOLEMAAAU1'(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
cnf(4,axiom,
( element(X)
| times(X,Y) != X
| times(X,X) != Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
cnf(5,negated_conjecture,
element('SKOLEMAAAU2'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
cnf(6,negated_conjecture,
element('SKOLEMAAAU3'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
cnf(7,negated_conjecture,
~ element(times('SKOLEMAAAU2','SKOLEMAAAU3')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
cnf(8,plain,
times('SKOLEMAAAU3','SKOLEMAAAU3') = 'SKOLEMAAAU1'('SKOLEMAAAU3'),
inference('HYPERRESOLVE',[status(thm)],[3,6]) ).
cnf(9,plain,
times('SKOLEMAAAU2','SKOLEMAAAU2') = 'SKOLEMAAAU1'('SKOLEMAAAU2'),
inference('HYPERRESOLVE',[status(thm)],[3,5]) ).
cnf(10,plain,
times('SKOLEMAAAU3',times('SKOLEMAAAU3','SKOLEMAAAU3')) = 'SKOLEMAAAU3',
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[2,6]),8,theory(equality)]) ).
cnf(11,plain,
times('SKOLEMAAAU2',times('SKOLEMAAAU2','SKOLEMAAAU2')) = 'SKOLEMAAAU2',
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[2,5]),9,theory(equality)]) ).
cnf(13,plain,
times(times(X,Y),times(Z,U)) = times(Y,times(U,times(X,Z))),
inference('PARAMODULATE',[status(thm)],[1,1,theory(equality)]) ).
cnf(15,plain,
times(times(times(X,Y),Z),U) = times(times(Z,X),times(U,Y)),
inference('PARAMODULATE',[status(thm)],[1,1,theory(equality)]) ).
cnf(21,plain,
times(times('SKOLEMAAAU3','SKOLEMAAAU3'),'SKOLEMAAAU3') = 'SKOLEMAAAU3',
inference('PARAMODULATE',[status(thm)],[1,10,theory(equality)]) ).
cnf(22,plain,
times('SKOLEMAAAU3',X) = times(times('SKOLEMAAAU3','SKOLEMAAAU3'),times(X,'SKOLEMAAAU3')),
inference('PARAMODULATE',[status(thm)],[1,10,theory(equality)]) ).
cnf(23,plain,
times(times(X,'SKOLEMAAAU3'),times('SKOLEMAAAU3','SKOLEMAAAU3')) = times(X,'SKOLEMAAAU3'),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,10,theory(equality)]),15,theory(equality)]) ).
cnf(24,plain,
times(times('SKOLEMAAAU2','SKOLEMAAAU2'),'SKOLEMAAAU2') = 'SKOLEMAAAU2',
inference('PARAMODULATE',[status(thm)],[1,11,theory(equality)]) ).
cnf(25,plain,
times('SKOLEMAAAU2',X) = times(times('SKOLEMAAAU2','SKOLEMAAAU2'),times(X,'SKOLEMAAAU2')),
inference('PARAMODULATE',[status(thm)],[1,11,theory(equality)]) ).
cnf(26,plain,
times(times(X,'SKOLEMAAAU2'),times('SKOLEMAAAU2','SKOLEMAAAU2')) = times(X,'SKOLEMAAAU2'),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,11,theory(equality)]),15,theory(equality)]) ).
cnf(27,plain,
times(times('SKOLEMAAAU3',X),times('SKOLEMAAAU3','SKOLEMAAAU3')) = times(X,'SKOLEMAAAU3'),
inference('PARAMODULATE',[status(thm)],[1,21,theory(equality)]) ).
cnf(28,plain,
times('SKOLEMAAAU3',X) = times(times('SKOLEMAAAU3','SKOLEMAAAU3'),times('SKOLEMAAAU3',X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,21,theory(equality)]),13,theory(equality)]) ).
cnf(30,plain,
times(times('SKOLEMAAAU2',X),times('SKOLEMAAAU2','SKOLEMAAAU2')) = times(X,'SKOLEMAAAU2'),
inference('PARAMODULATE',[status(thm)],[1,24,theory(equality)]) ).
cnf(36,plain,
times('SKOLEMAAAU3',times(X,Y)) = times(times('SKOLEMAAAU3','SKOLEMAAAU3'),times(Y,times('SKOLEMAAAU3',X))),
inference('PARAMODULATE',[status(thm)],[22,1,theory(equality)]) ).
cnf(46,plain,
times('SKOLEMAAAU2',times(X,Y)) = times(times('SKOLEMAAAU2','SKOLEMAAAU2'),times(Y,times('SKOLEMAAAU2',X))),
inference('PARAMODULATE',[status(thm)],[25,1,theory(equality)]) ).
cnf(52,plain,
times(times(X,'SKOLEMAAAU3'),Y) = times('SKOLEMAAAU3',times(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,27,theory(equality)]),36,theory(equality)]) ).
cnf(56,plain,
times(times('SKOLEMAAAU3',X),Y) = times(times('SKOLEMAAAU3',X),times(Y,times('SKOLEMAAAU3','SKOLEMAAAU3'))),
inference('PARAMODULATE',[status(thm)],[1,28,theory(equality)]) ).
cnf(59,plain,
times(times(X,'SKOLEMAAAU2'),Y) = times('SKOLEMAAAU2',times(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,30,theory(equality)]),46,theory(equality)]) ).
cnf(71,plain,
times(X,'SKOLEMAAAU3') = times('SKOLEMAAAU3',X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,21,theory(equality)]),23,1,theory(equality)]) ).
cnf(86,plain,
~ element(times('SKOLEMAAAU3','SKOLEMAAAU2')),
inference('PARAMODULATE',[status(thm)],[7,71,theory(equality)]) ).
cnf(90,plain,
times(times('SKOLEMAAAU3',X),Y) = times('SKOLEMAAAU3',times(Y,X)),
inference('PARAMODULATE',[status(thm)],[1,71,theory(equality)]) ).
cnf(92,plain,
times(times('SKOLEMAAAU3',X),Y) = times(X,times('SKOLEMAAAU3',Y)),
inference('PARAMODULATE',[status(thm)],[1,71,theory(equality)]) ).
cnf(100,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[4,86,1]),26,56,92,90,59,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG210+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 8 17:34:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T17:34:08
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-08T17:34:08
% 0.40/0.56
% 0.40/0.56
% 0.40/0.56 #||
% 0.40/0.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.56 % SZS output start Refutation
% See solution above
% 0.40/0.56 ||#
% 0.40/0.56
% 0.40/0.56 ; Summary of computation:
% 0.40/0.56 ; 406 formulas have been input or derived (from 31 formulas).
% 0.40/0.56 ; 100 (25%) were retained. Of these,
% 0.40/0.56 ; 6 ( 6%) were simplified or subsumed later,
% 0.40/0.56 ; 94 (94%) are still being kept.
% 0.40/0.56 ;
% 0.40/0.56 ; Run time in seconds excluding printing time:
% 0.40/0.56 ; 0.001 1% Read assertion file (1 call)
% 0.40/0.56 ; 0.001 1% Assert (3 calls)
% 0.40/0.56 ; 0.012 14% Process new row (239 calls)
% 0.40/0.56 ; 0.006 7% Resolution (60 calls)
% 0.40/0.56 ; 0.010 12% Paramodulation (30 calls)
% 0.40/0.56 ; 0.000 0% Condensing (17 calls)
% 0.40/0.56 ; 0.001 1% Forward subsumption (17 calls)
% 0.40/0.56 ; 0.000 0% Backward subsumption (14 calls)
% 0.40/0.56 ; 0.000 0% Clause clause subsumption (29 calls)
% 0.40/0.56 ; 0.013 15% Forward simplification (239 calls)
% 0.40/0.56 ; 0.004 5% Backward simplification (100 calls)
% 0.40/0.56 ; 0.014 16% Ordering (1,948 calls)
% 0.40/0.56 ; 0.000 0% Sortal reasoning (32 calls)
% 0.40/0.56 ; 0.000 0% Purity testing (1 call)
% 0.40/0.57 ; 0.023 27% Other
% 0.40/0.57 ; 0.085 Total
% 0.40/0.57 ; 0.091 Real time
% 0.40/0.57 ;
% 0.40/0.57 ; Term-hash-array has 253 terms in all.
% 0.40/0.57 ; Feature-vector-row-index has 11 entries (11 at peak, 14 added, 3 deleted).
% 0.40/0.57 ; Feature-vector-row-index has 61 nodes (61 at peak, 90 added, 29 deleted).
% 0.40/0.57 ; Retrieved 30 possibly forward subsuming rows in 17 calls.
% 0.40/0.57 ; Retrieved 1 possibly backward subsumed row in 14 calls.
% 0.40/0.57 ; Path-index has 247 entries (247 at peak, 259 added, 12 deleted).
% 0.40/0.57 ; Path-index has 170 nodes (170 at peak, 172 added, 2 deleted).
% 0.40/0.57 ; Trie-index has 247 entries (247 at peak, 259 added, 12 deleted).
% 0.40/0.57 ; Trie-index has 836 nodes (836 at peak, 881 added, 45 deleted).
% 0.40/0.57 ; Retrieved 1,241 generalization terms in 1,254 calls.
% 0.40/0.57 ; Retrieved 642 instance terms in 141 calls.
% 0.40/0.57 ; Retrieved 2,104 unifiable terms in 366 calls.
% 0.40/0.57 ;
% 0.40/0.57 ; The agenda of rows to process has 1 entry:
% 0.40/0.57 ; 1 with value 27
% 0.40/0.57 ; The agenda of rows to give has 63 entries:
% 0.40/0.57 ; 3 with value (4 18) 12 with value (4 22) 1 with value (4 31)
% 0.40/0.57 ; 2 with value (4 19) 14 with value (4 23) 1 with value (4 33)
% 0.40/0.57 ; 16 with value (4 20) 11 with value (4 24) 1 with value (4 35)
% 0.40/0.57 ; 1 with value (4 21) 1 with value (4 26)
% 0.40/0.57 Evaluation took:
% 0.40/0.57 0.091 seconds of real time
% 0.40/0.57 0.080221 seconds of user run time
% 0.40/0.57 0.011205 seconds of system run time
% 0.40/0.57 0 calls to %EVAL
% 0.40/0.57 0 page faults and
% 0.40/0.57 6,093,008 bytes consed.
% 0.40/0.57 :PROOF-FOUND
% 0.40/0.57 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T17:34:08
% 0.40/0.57 :PROOF-FOUND
% 0.40/0.57 *
%------------------------------------------------------------------------------