TSTP Solution File: ITP325_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP325_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Mon May 20 22:18:14 EDT 2024
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 24
% Syntax : Number of formulae : 29 ( 7 unt; 22 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of types : 9 ( 9 usr)
% Number of type conns : 13 ( 8 >; 5 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'N$': $tType ).
tff(decl_sort2,type,
'N_a_b_vec_fun$': $tType ).
tff(decl_sort3,type,
'A_b_vec$': $tType ).
tff(decl_sort4,type,
'A_b_vec_n_vec$': $tType ).
tff(decl_sort5,type,
'B$': $tType ).
tff(decl_sort6,type,
'A_a_b_vec_n_vec_fun$': $tType ).
tff(decl_sort7,type,
'A_a_fun$': $tType ).
tff(decl_sort8,type,
'B_a_fun$': $tType ).
tff(decl_sort9,type,
'A$': $tType ).
tff(decl_54,type,
'a$a': 'A_b_vec_n_vec$' ).
tff(decl_90,type,
'vec_nth$a': 'A_b_vec_n_vec$' > 'N_a_b_vec_fun$' ).
tff(decl_94,type,
'fun_app$a': ( 'B_a_fun$' * 'B$' ) > 'A$' ).
tff(decl_101,type,
'i$': 'N$' ).
tff(decl_115,type,
'one$': 'A$' ).
tff(decl_147,type,
'j$': 'B$' ).
tff(decl_169,type,
'divide$': 'A$' > 'A_a_fun$' ).
tff(decl_172,type,
'fun_app$m': ( 'A_a_fun$' * 'A$' ) > 'A$' ).
tff(decl_191,type,
'fun_app$n': ( 'A_a_b_vec_n_vec_fun$' * 'A$' ) > 'A_b_vec_n_vec$' ).
tff(decl_214,type,
'interchange_A$': 'A_b_vec_n_vec$' ).
tff(decl_220,type,
'fun_app$b': ( 'N_a_b_vec_fun$' * 'N$' ) > 'A_b_vec$' ).
tff(decl_224,type,
'vec_nth$': 'A_b_vec$' > 'B_a_fun$' ).
tff(decl_230,type,
'mult_row$': ( 'A_b_vec_n_vec$' * 'N$' ) > 'A_a_b_vec_n_vec_fun$' ).
tff(conjecture104,conjecture,
'a$a' = 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture104) ).
tff(axiom105,axiom,
'a$a' = 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom105) ).
tff(c_0_2,negated_conjecture,
'a$a' != 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture104])]) ).
tff(c_0_3,negated_conjecture,
'a$a' != 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
tcf(c_0_4,plain,
'a$a' = 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(split_conjunct,[status(thm)],[axiom105]) ).
tcf(c_0_5,negated_conjecture,
'a$a' != 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
$false,
inference(sr,[status(thm)],[c_0_4,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP325_1 : TPTP v8.2.0. Released v8.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.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 : 300
% 0.13/0.34 % DateTime : Sat May 18 17:50:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # new_bool_3 with pid 21485 completed with status 0
% 0.20/0.54 # Result found by new_bool_3
% 0.20/0.54 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 272s (1) cores
% 0.20/0.54 # Starting new_bool_3 with 61s (1) cores
% 0.20/0.54 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21488 completed with status 0
% 0.20/0.54 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.54 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.20/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 272s (1) cores
% 0.20/0.54 # Preprocessing time : 0.006 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Theorem
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 803
% 0.20/0.54 # Removed by relevancy pruning/SinE : 597
% 0.20/0.54 # Initial clauses : 855
% 0.20/0.54 # Removed in clause preprocessing : 492
% 0.20/0.54 # Initial clauses in saturation : 363
% 0.20/0.54 # Processed clauses : 13
% 0.20/0.54 # ...of these trivial : 0
% 0.20/0.54 # ...subsumed : 3
% 0.20/0.54 # ...remaining for further processing : 9
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 0
% 0.20/0.54 # Backward-rewritten : 0
% 0.20/0.54 # Generated clauses : 0
% 0.20/0.54 # ...of the previous two non-redundant : 0
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 0
% 0.20/0.54 # Paramodulations : 0
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 0
% 0.20/0.54 # ...of those cached : 0
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 9
% 0.20/0.54 # Positive orientable unit clauses : 3
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 6
% 0.20/0.54 # Non-unit-clauses : 0
% 0.20/0.54 # Current number of unprocessed clauses: 350
% 0.20/0.54 # ...number of literals in the above : 1018
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 0
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.54 # Non-unit clause-clause subsumptions : 0
% 0.20/0.54 # Unit Clause-clause subsumption calls : 8
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 0
% 0.20/0.54 # BW rewrite match successes : 0
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 42182
% 0.20/0.54 # Search garbage collected termcells : 10061
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.026 s
% 0.20/0.54 # System time : 0.008 s
% 0.20/0.54 # Total time : 0.034 s
% 0.20/0.54 # Maximum resident set size: 4568 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.057 s
% 0.20/0.54 # System time : 0.011 s
% 0.20/0.54 # Total time : 0.068 s
% 0.20/0.54 # Maximum resident set size: 2716 pages
% 0.20/0.54 % E---3.1 exiting
% 0.20/0.54 % E exiting
%------------------------------------------------------------------------------