TSTP Solution File: ITP330_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP330_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat May 4 08:10:33 EDT 2024
% Result : Theorem 0.41s 0.66s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 33
% Syntax : Number of formulae : 49 ( 13 unt; 27 typ; 0 def)
% Number of atoms : 35 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 8 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 12 ( 11 usr)
% Number of type conns : 14 ( 9 >; 5 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 20 !; 1 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_m_vec_set$': $tType ).
tff(decl_sort2,type,
'M_a_m_vec_fun$': $tType ).
tff(decl_sort3,type,
'A_n_vec$': $tType ).
tff(decl_sort4,type,
'M_set$': $tType ).
tff(decl_sort5,type,
'N_a_n_vec_fun$': $tType ).
tff(decl_sort6,type,
'M_a_fun$': $tType ).
tff(decl_sort7,type,
'A_m_vec$': $tType ).
tff(decl_sort8,type,
'N$': $tType ).
tff(decl_sort9,type,
'A_n_vec_n_vec$': $tType ).
tff(decl_sort10,type,
'A_n_vec_a_m_vec_fun$': $tType ).
tff(decl_sort11,type,
'A_m_vec_bool_fun$': $tType ).
tff(decl_34,type,
'vec_nth$a': 'A_n_vec_n_vec$' > 'N_a_n_vec_fun$' ).
tff(decl_68,type,
'cart_basis_Rn$': 'A_n_vec_n_vec$' ).
tff(decl_82,type,
'fun_app$ar': ( 'A_n_vec_a_m_vec_fun$' * 'A_n_vec$' ) > 'A_m_vec$' ).
tff(decl_96,type,
'member$a': ( 'A_m_vec$' * 'A_m_vec_set$' ) > $o ).
tff(decl_103,type,
'collect$': 'A_m_vec_bool_fun$' > 'A_m_vec_set$' ).
tff(decl_203,type,
'top$': 'M_set$' ).
tff(decl_272,type,
'sum$': ( 'M_a_m_vec_fun$' * 'M_set$' ) > 'A_m_vec$' ).
tff(decl_287,type,
'j$': 'N$' ).
tff(decl_306,type,
'thesis$': $o ).
tff(decl_374,type,
'uu$': 'M_a_fun$' > 'M_a_m_vec_fun$' ).
tff(decl_418,type,
'fun_app$a': ( 'N_a_n_vec_fun$' * 'N$' ) > 'A_n_vec$' ).
tff(decl_439,type,
'top$b': 'A_m_vec_set$' ).
tff(decl_530,type,
'fun_app$': ( 'A_m_vec_bool_fun$' * 'A_m_vec$' ) > $o ).
tff(decl_600,type,
'f$': 'A_n_vec_a_m_vec_fun$' ).
tff(decl_624,type,
'uua$': 'A_m_vec_bool_fun$' ).
tff(decl_651,type,
esk6_1: 'A_m_vec$' > 'M_a_fun$' ).
fof(conjecture283,conjecture,
'thesis$',
file('/export/starexec/sandbox/tmp/tmp.BCnLhNb2EB/E---3.1_24695.p',conjecture283) ).
tff(axiom520,axiom,
! [X1: 'A_m_vec$',X1556: 'A_m_vec_bool_fun$'] :
( 'member$a'(X1,'collect$'(X1556))
<=> 'fun_app$'(X1556,X1) ),
file('/export/starexec/sandbox/tmp/tmp.BCnLhNb2EB/E---3.1_24695.p',axiom520) ).
tff(axiom319,axiom,
! [X1: 'A_m_vec$'] : 'member$a'(X1,'top$b'),
file('/export/starexec/sandbox/tmp/tmp.BCnLhNb2EB/E---3.1_24695.p',axiom319) ).
tff(hypothesis284,hypothesis,
! [X845: 'M_a_fun$'] :
( ( 'sum$'('uu$'(X845),'top$') = 'fun_app$ar'('f$','fun_app$a'('vec_nth$a'('cart_basis_Rn$'),'j$')) )
=> 'thesis$' ),
file('/export/starexec/sandbox/tmp/tmp.BCnLhNb2EB/E---3.1_24695.p',hypothesis284) ).
tff(axiom0,axiom,
! [X1: 'A_m_vec$'] :
( 'fun_app$'('uua$',X1)
<=> ? [X2: 'M_a_fun$'] : ( 'sum$'('uu$'(X2),'top$') = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.BCnLhNb2EB/E---3.1_24695.p',axiom0) ).
tff(axiom287,axiom,
'top$b' = 'collect$'('uua$'),
file('/export/starexec/sandbox/tmp/tmp.BCnLhNb2EB/E---3.1_24695.p',axiom287) ).
fof(c_0_6,negated_conjecture,
~ 'thesis$',
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture283])]) ).
tff(c_0_7,plain,
! [X2671: 'A_m_vec$',X2672: 'A_m_vec_bool_fun$'] :
( ( ~ 'member$a'(X2671,'collect$'(X2672))
| 'fun_app$'(X2672,X2671) )
& ( ~ 'fun_app$'(X2672,X2671)
| 'member$a'(X2671,'collect$'(X2672)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom520])])]) ).
tff(c_0_8,plain,
! [X2676: 'A_m_vec$'] : 'member$a'(X2676,'top$b'),
inference(variable_rename,[status(thm)],[axiom319]) ).
tff(c_0_9,hypothesis,
! [X2567: 'M_a_fun$'] :
( ( 'sum$'('uu$'(X2567),'top$') != 'fun_app$ar'('f$','fun_app$a'('vec_nth$a'('cart_basis_Rn$'),'j$')) )
| 'thesis$' ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[hypothesis284])])]) ).
fof(c_0_10,negated_conjecture,
~ 'thesis$',
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tff(c_0_11,plain,
! [X2595: 'A_m_vec$',X2597: 'A_m_vec$',X2598: 'M_a_fun$'] :
( ( ~ 'fun_app$'('uua$',X2595)
| ( 'sum$'('uu$'(esk6_1(X2595)),'top$') = X2595 ) )
& ( ( 'sum$'('uu$'(X2598),'top$') != X2597 )
| 'fun_app$'('uua$',X2597) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom0])])])])])]) ).
tcf(c_0_12,plain,
! [X1: 'A_m_vec$',X1556: 'A_m_vec_bool_fun$'] :
( 'fun_app$'(X1556,X1)
| ~ 'member$a'(X1,'collect$'(X1556)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_13,plain,
'top$b' = 'collect$'('uua$'),
inference(split_conjunct,[status(thm)],[axiom287]) ).
tcf(c_0_14,plain,
! [X1: 'A_m_vec$'] : 'member$a'(X1,'top$b'),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_15,hypothesis,
! [X2: 'M_a_fun$'] :
( 'thesis$'
| ( 'sum$'('uu$'(X2),'top$') != 'fun_app$ar'('f$','fun_app$a'('vec_nth$a'('cart_basis_Rn$'),'j$')) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ 'thesis$',
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_17,plain,
! [X1: 'A_m_vec$'] :
( ( 'sum$'('uu$'(esk6_1(X1)),'top$') = X1 )
| ~ 'fun_app$'('uua$',X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_18,plain,
! [X1: 'A_m_vec$'] : 'fun_app$'('uua$',X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
tcf(c_0_19,hypothesis,
! [X2: 'M_a_fun$'] : 'sum$'('uu$'(X2),'top$') != 'fun_app$ar'('f$','fun_app$a'('vec_nth$a'('cart_basis_Rn$'),'j$')),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
tcf(c_0_20,plain,
! [X1: 'A_m_vec$'] : 'sum$'('uu$'(esk6_1(X1)),'top$') = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,hypothesis,
$false,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ITP330_1 : TPTP v8.1.2. Released v8.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:55:36 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.39/0.59 Running first-order model finding
% 0.39/0.59 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.BCnLhNb2EB/E---3.1_24695.p
% 0.41/0.66 # Version: 3.1.0
% 0.41/0.66 # partial match(1): FMLMSLSMSSSNFFN
% 0.41/0.66 # Preprocessing class: FMLMSLLMSSSNFFN.
% 0.41/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.66 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.41/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.66 # Starting sh5l with 300s (1) cores
% 0.41/0.66 # new_bool_3 with pid 24774 completed with status 0
% 0.41/0.66 # Result found by new_bool_3
% 0.41/0.66 # partial match(1): FMLMSLSMSSSNFFN
% 0.41/0.66 # Preprocessing class: FMLMSLLMSSSNFFN.
% 0.41/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.66 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.41/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.66 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.41/0.66 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.41/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.66 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.41/0.66 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 24777 completed with status 0
% 0.41/0.66 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.41/0.66 # partial match(1): FMLMSLSMSSSNFFN
% 0.41/0.66 # Preprocessing class: FMLMSLLMSSSNFFN.
% 0.41/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.66 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.41/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.66 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.41/0.66 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.41/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.66 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.41/0.66 # Preprocessing time : 0.004 s
% 0.41/0.66 # Presaturation interreduction done
% 0.41/0.66
% 0.41/0.66 # Proof found!
% 0.41/0.66 # SZS status Theorem
% 0.41/0.66 # SZS output start CNFRefutation
% See solution above
% 0.41/0.66 # Parsed axioms : 1643
% 0.41/0.66 # Removed by relevancy pruning/SinE : 1587
% 0.41/0.66 # Initial clauses : 85
% 0.41/0.66 # Removed in clause preprocessing : 14
% 0.41/0.66 # Initial clauses in saturation : 71
% 0.41/0.66 # Processed clauses : 113
% 0.41/0.66 # ...of these trivial : 10
% 0.41/0.66 # ...subsumed : 6
% 0.41/0.66 # ...remaining for further processing : 97
% 0.41/0.66 # Other redundant clauses eliminated : 10
% 0.41/0.66 # Clauses deleted for lack of memory : 0
% 0.41/0.66 # Backward-subsumed : 0
% 0.41/0.66 # Backward-rewritten : 1
% 0.41/0.66 # Generated clauses : 25
% 0.41/0.66 # ...of the previous two non-redundant : 15
% 0.41/0.66 # ...aggressively subsumed : 0
% 0.41/0.66 # Contextual simplify-reflections : 0
% 0.41/0.66 # Paramodulations : 11
% 0.41/0.66 # Factorizations : 0
% 0.41/0.66 # NegExts : 0
% 0.41/0.66 # Equation resolutions : 14
% 0.41/0.66 # Disequality decompositions : 0
% 0.41/0.66 # Total rewrite steps : 18
% 0.41/0.66 # ...of those cached : 2
% 0.41/0.66 # Propositional unsat checks : 0
% 0.41/0.66 # Propositional check models : 0
% 0.41/0.66 # Propositional check unsatisfiable : 0
% 0.41/0.66 # Propositional clauses : 0
% 0.41/0.66 # Propositional clauses after purity: 0
% 0.41/0.66 # Propositional unsat core size : 0
% 0.41/0.66 # Propositional preprocessing time : 0.000
% 0.41/0.66 # Propositional encoding time : 0.000
% 0.41/0.66 # Propositional solver time : 0.000
% 0.41/0.66 # Success case prop preproc time : 0.000
% 0.41/0.66 # Success case prop encoding time : 0.000
% 0.41/0.66 # Success case prop solver time : 0.000
% 0.41/0.66 # Current number of processed clauses : 33
% 0.41/0.66 # Positive orientable unit clauses : 13
% 0.41/0.66 # Positive unorientable unit clauses: 0
% 0.41/0.66 # Negative unit clauses : 2
% 0.41/0.66 # Non-unit-clauses : 18
% 0.41/0.66 # Current number of unprocessed clauses: 27
% 0.41/0.66 # ...number of literals in the above : 50
% 0.41/0.66 # Current number of archived formulas : 0
% 0.41/0.66 # Current number of archived clauses : 55
% 0.41/0.66 # Clause-clause subsumption calls (NU) : 127
% 0.41/0.66 # Rec. Clause-clause subsumption calls : 123
% 0.41/0.66 # Non-unit clause-clause subsumptions : 4
% 0.41/0.66 # Unit Clause-clause subsumption calls : 2
% 0.41/0.66 # Rewrite failures with RHS unbound : 0
% 0.41/0.66 # BW rewrite match attempts : 4
% 0.41/0.66 # BW rewrite match successes : 3
% 0.41/0.66 # Condensation attempts : 0
% 0.41/0.66 # Condensation successes : 0
% 0.41/0.66 # Termbank termtop insertions : 16539
% 0.41/0.66 # Search garbage collected termcells : 10874
% 0.41/0.66
% 0.41/0.66 # -------------------------------------------------
% 0.41/0.66 # User time : 0.016 s
% 0.41/0.66 # System time : 0.009 s
% 0.41/0.66 # Total time : 0.025 s
% 0.41/0.66 # Maximum resident set size: 5884 pages
% 0.41/0.66
% 0.41/0.66 # -------------------------------------------------
% 0.41/0.66 # User time : 0.052 s
% 0.41/0.66 # System time : 0.011 s
% 0.41/0.66 # Total time : 0.063 s
% 0.41/0.66 # Maximum resident set size: 4504 pages
% 0.41/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------