TSTP Solution File: ITP190^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP190^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:16:44 EDT 2024
% Result : Theorem 1.56s 0.69s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 30
% Syntax : Number of formulae : 50 ( 24 unt; 22 typ; 0 def)
% Number of atoms : 32 ( 15 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 281 ( 7 ~; 3 |; 0 &; 270 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 8 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 44 !; 2 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
pi: $tType ).
thf(decl_sort2,type,
name: $tType ).
thf(decl_sort3,type,
list_P227219501e_name: $tType ).
thf(decl_sort4,type,
produc367475239e_name: $tType ).
thf(decl_sort5,type,
late_freeRes: $tType ).
thf(decl_sort6,type,
late_residual: $tType ).
thf(decl_33,type,
late_OutputR: name > name > late_freeRes ).
thf(decl_36,type,
late_FreeR: late_freeRes > pi > late_residual ).
thf(decl_40,type,
late_transitions: pi > late_residual > $o ).
thf(decl_48,type,
cons_P1213805021e_name: produc367475239e_name > list_P227219501e_name > list_P227219501e_name ).
thf(decl_50,type,
nil_Pr743626285e_name: list_P227219501e_name ).
thf(decl_90,type,
perm_name_pi: list_P227219501e_name > pi > pi ).
thf(decl_94,type,
perm_n414416632sidual: list_P227219501e_name > late_residual > late_residual ).
thf(decl_123,type,
produc1570949143e_name: name > name > produc367475239e_name ).
thf(decl_151,type,
q: pi ).
thf(decl_153,type,
q_a: pi ).
thf(decl_156,type,
aa: name ).
thf(decl_157,type,
b: name ).
thf(decl_158,type,
x: name ).
thf(decl_160,type,
z: name ).
thf(decl_281,type,
esk116_1: produc367475239e_name > name ).
thf(decl_282,type,
esk117_1: produc367475239e_name > name ).
thf(conj_0,conjecture,
late_transitions @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ q ) @ ( perm_n414416632sidual @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ ( late_FreeR @ ( late_OutputR @ aa @ x ) @ q_a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_14_perm__swap_I1_J,axiom,
! [X1: name,X2: name,X7: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ X7 ) )
= X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_14_perm__swap_I1_J) ).
thf(fact_223_surj__pair,axiom,
! [X339: produc367475239e_name] :
? [X272: name,X247: name] :
( X339
= ( produc1570949143e_name @ X272 @ X247 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_223_surj__pair) ).
thf(fact_24_name__swap,axiom,
! [X1: name,X2: name,X15: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ X15 )
= ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X2 @ X1 ) @ nil_Pr743626285e_name ) @ X15 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_24_name__swap) ).
thf(fact_41_eqvt,axiom,
! [X28: pi,X29: late_residual,X30: list_P227219501e_name] :
( ( late_transitions @ X28 @ X29 )
=> ( late_transitions @ ( perm_name_pi @ X30 @ X28 ) @ ( perm_n414416632sidual @ X30 @ X29 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_41_eqvt) ).
thf(fact_40_perm__swap_I2_J,axiom,
! [X1: name,X2: name,X27: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X2 @ X1 ) @ nil_Pr743626285e_name ) @ X27 ) )
= X27 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_40_perm__swap_I2_J) ).
thf(fact_6_cOpen_Ohyps_I1_J,axiom,
late_transitions @ q @ ( late_FreeR @ ( late_OutputR @ b @ x ) @ q_a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_cOpen_Ohyps_I1_J) ).
thf(fact_0__092_060open_062a_A_061_Ab_092_060close_062,axiom,
aa = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062a_A_061_Ab_092_060close_062) ).
thf(c_0_8,negated_conjecture,
~ ( late_transitions @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ q ) @ ( perm_n414416632sidual @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ ( late_FreeR @ ( late_OutputR @ aa @ x ) @ q_a ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_9,plain,
! [X1912: name,X1913: name,X1914: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1912 @ X1913 ) @ nil_Pr743626285e_name ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1912 @ X1913 ) @ nil_Pr743626285e_name ) @ X1914 ) )
= X1914 ),
inference(variable_rename,[status(thm)],[fact_14_perm__swap_I1_J]) ).
thf(c_0_10,plain,
! [X2598: produc367475239e_name] :
( X2598
= ( produc1570949143e_name @ ( esk116_1 @ X2598 ) @ ( esk117_1 @ X2598 ) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_223_surj__pair])]) ).
thf(c_0_11,negated_conjecture,
~ ( late_transitions @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ q ) @ ( perm_n414416632sidual @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ ( late_FreeR @ ( late_OutputR @ aa @ x ) @ q_a ) ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X1937: name,X1938: name,X1939: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1937 @ X1938 ) @ nil_Pr743626285e_name ) @ X1939 )
= ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1938 @ X1937 ) @ nil_Pr743626285e_name ) @ X1939 ) ),
inference(variable_rename,[status(thm)],[fact_24_name__swap]) ).
thf(c_0_13,plain,
! [X1975: pi,X1976: late_residual,X1977: list_P227219501e_name] :
( ~ ( late_transitions @ X1975 @ X1976 )
| ( late_transitions @ ( perm_name_pi @ X1977 @ X1975 ) @ ( perm_n414416632sidual @ X1977 @ X1976 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_41_eqvt])])]) ).
thf(c_0_14,plain,
! [X1: name,X2: name,X7: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ X7 ) )
= X7 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X179: produc367475239e_name] :
( X179
= ( produc1570949143e_name @ ( esk116_1 @ X179 ) @ ( esk117_1 @ X179 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,negated_conjecture,
~ ( late_transitions @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ q ) @ ( perm_n414416632sidual @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ ( late_FreeR @ ( late_OutputR @ aa @ x ) @ q_a ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
! [X1: name,X2: name,X7: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ X7 )
= ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X2 @ X1 ) @ nil_Pr743626285e_name ) @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X7: pi,X30: list_P227219501e_name,X29: late_residual] :
( ( late_transitions @ ( perm_name_pi @ X30 @ X7 ) @ ( perm_n414416632sidual @ X30 @ X29 ) )
| ~ ( late_transitions @ X7 @ X29 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
! [X179: produc367475239e_name,X7: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ X179 @ nil_Pr743626285e_name ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ X179 @ nil_Pr743626285e_name ) @ X7 ) )
= X7 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
! [X1972: name,X1973: name,X1974: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1972 @ X1973 ) @ nil_Pr743626285e_name ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1973 @ X1972 ) @ nil_Pr743626285e_name ) @ X1974 ) )
= X1974 ),
inference(variable_rename,[status(thm)],[fact_40_perm__swap_I2_J]) ).
thf(c_0_21,plain,
late_transitions @ q @ ( late_FreeR @ ( late_OutputR @ b @ x ) @ q_a ),
inference(split_conjunct,[status(thm)],[fact_6_cOpen_Ohyps_I1_J]) ).
thf(c_0_22,plain,
aa = b,
inference(split_conjunct,[status(thm)],[fact_0__092_060open_062a_A_061_Ab_092_060close_062]) ).
thf(c_0_23,negated_conjecture,
~ ( late_transitions @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ x @ z ) @ nil_Pr743626285e_name ) @ q ) @ ( perm_n414416632sidual @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ z @ x ) @ nil_Pr743626285e_name ) @ ( late_FreeR @ ( late_OutputR @ aa @ x ) @ q_a ) ) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_24,plain,
! [X7: pi,X179: produc367475239e_name,X29: late_residual] :
( ( late_transitions @ X7 @ ( perm_n414416632sidual @ ( cons_P1213805021e_name @ X179 @ nil_Pr743626285e_name ) @ X29 ) )
| ~ ( late_transitions @ ( perm_name_pi @ ( cons_P1213805021e_name @ X179 @ nil_Pr743626285e_name ) @ X7 ) @ X29 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_25,plain,
! [X1: name,X2: name,X7: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X2 @ X1 ) @ nil_Pr743626285e_name ) @ X7 ) )
= X7 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,plain,
late_transitions @ q @ ( late_FreeR @ ( late_OutputR @ aa @ x ) @ q_a ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP190^1 : TPTP v8.2.0. Released v7.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n020.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 16:33:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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
% 1.56/0.69 # Version: 3.1.0-ho
% 1.56/0.69 # Preprocessing class: HSLMSMSMSSSNHFA.
% 1.56/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.56/0.69 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.56/0.69 # Starting new_ho_10 with 300s (1) cores
% 1.56/0.69 # Starting new_bool_6 with 300s (1) cores
% 1.56/0.69 # Starting lpo8_s with 300s (1) cores
% 1.56/0.69 # new_ho_10_cnf2 with pid 12596 completed with status 0
% 1.56/0.69 # Result found by new_ho_10_cnf2
% 1.56/0.69 # Preprocessing class: HSLMSMSMSSSNHFA.
% 1.56/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.56/0.69 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.56/0.69 # No SInE strategy applied
% 1.56/0.69 # Search class: HGHSM-FSLM31-MHFFFFBN
% 1.56/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.56/0.69 # Starting new_ho_11 with 811s (1) cores
% 1.56/0.69 # Starting new_ho_10_cnf2 with 151s (1) cores
% 1.56/0.69 # Starting almost_fo_3 with 136s (1) cores
% 1.56/0.69 # Starting ehoh_best4_fo with 136s (1) cores
% 1.56/0.69 # Starting lpo4_lambdas_fix with 136s (1) cores
% 1.56/0.69 # almost_fo_3 with pid 12604 completed with status 0
% 1.56/0.69 # Result found by almost_fo_3
% 1.56/0.69 # Preprocessing class: HSLMSMSMSSSNHFA.
% 1.56/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.56/0.69 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.56/0.69 # No SInE strategy applied
% 1.56/0.69 # Search class: HGHSM-FSLM31-MHFFFFBN
% 1.56/0.69 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.56/0.69 # Starting new_ho_11 with 811s (1) cores
% 1.56/0.69 # Starting new_ho_10_cnf2 with 151s (1) cores
% 1.56/0.69 # Starting almost_fo_3 with 136s (1) cores
% 1.56/0.69 # Preprocessing time : 0.018 s
% 1.56/0.69 # Presaturation interreduction done
% 1.56/0.69
% 1.56/0.69 # Proof found!
% 1.56/0.69 # SZS status Theorem
% 1.56/0.69 # SZS output start CNFRefutation
% See solution above
% 1.56/0.69 # Parsed axioms : 540
% 1.56/0.69 # Removed by relevancy pruning/SinE : 0
% 1.56/0.69 # Initial clauses : 972
% 1.56/0.69 # Removed in clause preprocessing : 234
% 1.56/0.69 # Initial clauses in saturation : 738
% 1.56/0.69 # Processed clauses : 1138
% 1.56/0.69 # ...of these trivial : 47
% 1.56/0.69 # ...subsumed : 86
% 1.56/0.69 # ...remaining for further processing : 1005
% 1.56/0.69 # Other redundant clauses eliminated : 54
% 1.56/0.69 # Clauses deleted for lack of memory : 0
% 1.56/0.69 # Backward-subsumed : 10
% 1.56/0.69 # Backward-rewritten : 18
% 1.56/0.69 # Generated clauses : 575
% 1.56/0.69 # ...of the previous two non-redundant : 341
% 1.56/0.69 # ...aggressively subsumed : 0
% 1.56/0.69 # Contextual simplify-reflections : 22
% 1.56/0.69 # Paramodulations : 415
% 1.56/0.69 # Factorizations : 0
% 1.56/0.69 # NegExts : 0
% 1.56/0.69 # Equation resolutions : 76
% 1.56/0.69 # Disequality decompositions : 0
% 1.56/0.69 # Total rewrite steps : 247
% 1.56/0.69 # ...of those cached : 102
% 1.56/0.69 # Propositional unsat checks : 0
% 1.56/0.69 # Propositional check models : 0
% 1.56/0.69 # Propositional check unsatisfiable : 0
% 1.56/0.69 # Propositional clauses : 0
% 1.56/0.69 # Propositional clauses after purity: 0
% 1.56/0.69 # Propositional unsat core size : 0
% 1.56/0.69 # Propositional preprocessing time : 0.000
% 1.56/0.69 # Propositional encoding time : 0.000
% 1.56/0.69 # Propositional solver time : 0.000
% 1.56/0.69 # Success case prop preproc time : 0.000
% 1.56/0.69 # Success case prop encoding time : 0.000
% 1.56/0.69 # Success case prop solver time : 0.000
% 1.56/0.69 # Current number of processed clauses : 318
% 1.56/0.69 # Positive orientable unit clauses : 131
% 1.56/0.69 # Positive unorientable unit clauses: 0
% 1.56/0.69 # Negative unit clauses : 50
% 1.56/0.69 # Non-unit-clauses : 137
% 1.56/0.69 # Current number of unprocessed clauses: 578
% 1.56/0.69 # ...number of literals in the above : 1620
% 1.56/0.69 # Current number of archived formulas : 0
% 1.56/0.69 # Current number of archived clauses : 680
% 1.56/0.69 # Clause-clause subsumption calls (NU) : 68761
% 1.56/0.69 # Rec. Clause-clause subsumption calls : 40106
% 1.56/0.69 # Non-unit clause-clause subsumptions : 97
% 1.56/0.69 # Unit Clause-clause subsumption calls : 3365
% 1.56/0.69 # Rewrite failures with RHS unbound : 0
% 1.56/0.69 # BW rewrite match attempts : 115
% 1.56/0.69 # BW rewrite match successes : 72
% 1.56/0.69 # Condensation attempts : 0
% 1.56/0.69 # Condensation successes : 0
% 1.56/0.69 # Termbank termtop insertions : 74918
% 1.56/0.69 # Search garbage collected termcells : 14990
% 1.56/0.69
% 1.56/0.69 # -------------------------------------------------
% 1.56/0.69 # User time : 0.163 s
% 1.56/0.69 # System time : 0.020 s
% 1.56/0.69 # Total time : 0.183 s
% 1.56/0.69 # Maximum resident set size: 6264 pages
% 1.56/0.69
% 1.56/0.69 # -------------------------------------------------
% 1.56/0.69 # User time : 0.630 s
% 1.56/0.69 # System time : 0.055 s
% 1.56/0.69 # Total time : 0.686 s
% 1.56/0.69 # Maximum resident set size: 2860 pages
% 1.56/0.69 % E---3.1 exiting
% 1.56/0.69 % E exiting
%------------------------------------------------------------------------------